http://books.nips.cc/nips20.html NIPS 2007 PP http://books.nips.cc/papers/files/nips20/NIPS2007_0637.pdf 162 Mining Internet-Scale Software Repositories acad advances aksit allocation american analysis analyzing approximate april archives arlington articles artificial aspect association auai author authors automatic based beal berlin blei block brill brin bringing buntine century chemudugunta citation classification code comput conference could data database dbpubs decomposition deerwester digital dirichlet discovery documents dumais editors eighteenth eighth empirical engineering entities european finding forum furnas giles grams griffiths harshman heidelberg hierarchical http indexing information intelligence international irwin january jordan journal kiczales knowledge krovetz lamping landauer latent learning library loingtier lopes machine maeda mark matches matching matsuoka maximal mehmet menhdhekar michal mining model models motwani national natl newman news newspaper object open order oriented padhraic page pagerank pages paper papers part platform posters premraj press probabilistic proc proceedings processes programming ranking references research rosen satoshi schroter science scientific search semantic september short sidl sigir sigkdd smyth society software some source speech springer stanford states statistical steyvers string suppl symposium tagging talk technol tenth theor thomas topic topics transformation ugurel ukkonen uncertainty united using verlag virginia volume what winograd with working york your zeller zimmermann http://books.nips.cc/papers/files/nips20/NIPS2007_0219.pdf 293 Learning with Transformation Invariant Kernels advances amsterdam applied approximation baltimore based becker between beyond biological boughorbel boujemaa cambridge chang chapelle classification coefficients computation computational computations conditionally connection constructing cybernetics data definite department descriptive dietterich discriminative edition empirical feature features fleuret germany ghahramani golub guide hopkins iccv icme ieee image incorporating inference information institute invariance invariances invariant johns kernel kernels learning linear loan machine machines math mathematics matrix mika models monographs muller national networks neural nonlinear observational operators optimization pami philadelphia planck positive practical press primal proc processing ratsch rayleigh recognition references regularization report sahbi scale scattered scholkopf sctv series siam smola spaces spline support systems taiwan tarel technical training transformation triangular tubingen university vector wahba walder wendland weston with workshop http://books.nips.cc/papers/files/nips20/NIPS2007_0205.pdf 142 Selecting Observations against Adversarial Objectives accelerated adaptive adversarial against algorithm algorithms analysis annual appear applications approximating approximation approximations arkin battle biological boyd bretherton cambridge challenge combinatorica computation computing conference convex cost cover covering daily data decision design designs detection distribution effective efficient empirical engineers environmetrics epanet experiments faloutsos feige fisher flaherty focs fujito functions gaussian glance greedy guestrin gupta http jisao jmlr jordan journal kempe krause learning leskovec linear machine management march mathematical maximizing mcmahan minimax near nemhauser networks nips northwest objectives observations optimal optimization ostfeld outbreak pacific placements planning precipitation press problem process processes producing programmer programming rasmussen references regression related report resolution resources review robertazzi robust robustness rossman sacks salomons schiller schwartz scientific selecting selection sensor sequential sets siam singh spatial springer statistical studies submodular subset symposium systems technical theory threshold tieice toolkit topics uber under vanbriesen vandenberghe washington water widmann wiens williams with wolsey http://books.nips.cc/papers/files/nips20/NIPS2007_1119.pdf 83 Discovering Weakly-Interacting Factors in a Complex Stochastic Process aaai about algorithm analysis andrew approximate architecture artificial automatic automatically batmobile bayesian berkeley bioinformatics boyen brenda briefings causation charlie clustering complex computational computer conference daphne data dbns dean decomposing division dynamic exploiting factored forbes frogner from frontier gene geoffrey harvard heuristics huang imot inference inferring information intelligence interaction international jeff joint jordan kanazawa keiji kevin koller learning leonid michael microarray miyano model models monitoring murphy national network networks neural particles persistence peshkin pfeffer probabilistic proceedings processes processing reasoning recognition references report representation russell satoru scalable science seiya separability series spectral speech stochastic stuart sufficiency systems taxi technical temporal thesis thomas time towards tractable uncertainty university using weak weiss xavier yair yong zweig http://books.nips.cc/papers/files/nips20/NIPS2007_0985.pdf 140 Hierarchical Apprenticeship Learning, with Application to Quadruped Locomotion aaai abbeel abstraction advances altun andrew application applications apprenticeship approach artificial atkeson automation bagnell barto between biped boosting bradley carlos chatalbashev chestnutt chih choi christopher climbing complex conference daphne david decomposition dietterich differential discovery discrete doina dynamic environment environments event fast framework from function gait guestrin gurjeet hierarchical hierarchices hofmann honglak humanoid icml icra ieee ijcai imitation information intelligence interdependent international inverse irrelevant james joachims joel joint jong journal july kagami kang kohl koichi koller kuffner large learning locomotion machine machines mahadevan margin martin maximum maxq mdps methods minimax models morimoto nate nathan navigation negociation neural nicholas nineteenth nips nishiwaki obstacle output pages parr peter pieter planning precup prediction proceedings processing programming quadruped quadrupedal ratliff recent references reinforcement research richard robot robotics robust ronald russell satinder satoshi semi shen singh sridhar state stone strategies structured stuart sutton systems taskar temporal theory thomas tsochantaridis value variables vassil walking with yirong zinkevich http://books.nips.cc/papers/files/nips20/NIPS2007_0525.pdf 241 Collective Inference on Markov Models for Modeling Bird Migration abstract academy acids activity aldous algorithms allocation america american analysis application applications approach archilochus arxiv berkeley biological bird birds book cambridge caruana chains charniak chvatal circulation citebase citizen colubris combinatorial commission conditional cowles cross dantzig data distribution doyle durbin economics eddy editor editors electric elhawary eling entropy fields fill fink freeman functions gaussian generalized ghahramani gill goldberg graphs harmonic hidden hochachka html http hummingbird icml ieee inference information integer johnson kelling koopmans krogh labeling lafferty language learning linear magazine markov math maximum mccallum method minimization mining mitchison models modi monograph munson natural networks north nucleic number oper ornithologists pages parsing pereira philadelphia phillips plotkin poole predict preparation press prevalence probabilistic problem proc proceedings production programming properties proteins rabiner random recognition references research reversible riedewald robinson roth ruby sargent schapire science sciences segmenting selected semi sequence shore sigkdd simplex snell sorokina species speech stat statistical supervised tardos techniques theory throated trans transportation tutorial union university users using volume walks washington wild wiley york http://books.nips.cc/papers/files/nips20/NIPS2007_0164.pdf 297 Regularized Boost for Semi-Supervised Learning adaptive advances advantage agreement alche algorithm algorithmic ambroise analysis bartlett base based baxter begio behaviors belkin bennett berlin blake boost boosting bousquet california cambridge chapelle classification classifier classifiers classify collins combining computer conf consisl convolutional corpora data database databases demiriz demonstrated different discovery documents effectiveness empirical ensemble entity entropy examples explain expoliting face fasel fast formal framework frean from functional geometric global gradient grandvalet graph gunther harmonic have hein html http hypotheses inductive information irvine jaakkola jaffe journal justify kasrl kegl keogh knowledge kopf labeled lafferty language large learning leskes line literature lnai local machine maclin madison manifold manifolds margin marginboost mason mccallum measure merz methods michigan minimization mining mitchell mixture mixtures mlearn mlrepository models multiclass named natural networks neural nigam niyogi ongoing online partially pattern pfeiffer press proc processing proposed recognition references regularization regularized regularizer report repository research robust scalable scholkopf science semi sets sigdat sindhwani singer smoothness springer supervised supervising survey systems szummer technical techniques tency text theoretically theory thrum training types university unlabeled unsupervised using value verlag very wang weak weston wisconsin with work working zhou zien http://books.nips.cc/papers/files/nips20/NIPS2007_0534.pdf 173 Efficient Convex Relaxation for Transductive Support Vector Machine aaai advanced advances algorithms analysis annealing applications applied artificial bartlett bottou bound branch bundle cambridge chapelle class classification clustering collobert computer cones conference continuation convex cristianini density deterministic edition editors fields francisco functions gaussian generalized ghahramani ghaoui harmonic hiriart hoffman icml inference information intelligence interior international joachims jordan journal kaufmann keerthi kernel lafferty lanckriet large learning lemarechal literature machine machines madison margin mathematics matlab matrix maximum method methods minimization morgan multi nemirovsky nesterov neural optimization over pages part philadelphia platt point polynomial press proceedings processing programming publishers references report reseaerch research saul scale scholkopf schuurmans sciences sedumi semi semidefinite separation sindhwani sinz sixteenth software springer statistics studies sturm supervised support survey svms symmetric systems technical tenth text theory thrun toolbox transduction transductive twentith university unsupervised urruty using valizadegan vector verlag weston wisconsin with workshop york zien http://books.nips.cc/papers/files/nips20/NIPS2007_0782.pdf 198 Estimating divergence functionals and the likelihood ratio by penalized convex risk minimization acad american analysis another applications association asymptotic asymptotically bartlett based berkeley best bickel birge bounds broniatowski cambridge class classification coefficients complexity computational continuous convergence convex convexity covering csiszar curie data decentralized density dependent dept derivatives detection difference discrimination distribution distributions divergence divergences dual efficient empirical entropy estimates estimating estimation estimators free from functionals geer general gyorfi hall harlow hungar ibragimov ieee indirect inequalities inform information inst integral integrated international isit jordan journal kernels keziou khasminskii kulkarni laurent learning levit likelihood longman losses lsta marie massart math mcauliffe measures meulen morton multivariate nguyen nonlinear nonparametric number observation october order other pages parametric paris partitions pierre press princeton probability problems processes properties ratio references related report representation reproducing risk ritov rockafellar royal saitoh sankhya scholkopf series sharp silvey smola some springer squared stat statist statistical statistics studia surrogate symposium technical tests theory through topsoe transactions transmission type universite university vaart various verdu verlag wainwright wang weak wellner with york zhou http://books.nips.cc/papers/files/nips20/NIPS2007_0758.pdf 131 The Price of Bandit Information for Online Optimization adam adaptive advances adversarial adversary against alamitos algorithms allocation american annual application applied approaches arxiv aspects asymptotically auer available awerbuch bandit bartlett bianchi blum boosting bounds bulletin casino cesa colt comput computer computing conference dani dated decision design discrete distributed efficient eiji experiments extended feedback foundations freund from gambling generalization geometric gyorgy hayes high ieee issn journal june kakade kalai kernels kleinberg learn learning less linder line linear lugosi mach manfred manuscript mathematical mathematics mcmahan monitoring multiarmed multiplicative online optimization ottucsak page partial path press prints probability problem problems proceedings rakhlin references regret rigged robbing robbins routing rules santosh schapire science sciences sequential setting shortest siam society soda some stoc stochastic symposium syst system takimoto tewari theoretic theory thomas title under updates varsha vempala version volume warmuth website with working http://books.nips.cc/papers/files/nips20/NIPS2007_0445.pdf 134 Multi-Task Learning via Conic Programming acid advances algebra andreeva applications approaches bioinformatics biological borchers bottou boyd brenner cambridge caruana chothia cone conf convex convolution cruz csdp data database discovery discrete editors entropy evgeniou family from ghahramani graph haussler howorth hubbard information integrate july kandola kernels knowledge lafferty large lawrence learning lebret leon levin library lieven linear lobo machine margin maximizing methods micchelli mining multi multitask murzin networks neural noble nonparametric nucl optimization order pages pontil press principle proc processing programming ranking references refinements regularized report santa saul scop second semi semidefinite sequence shashua sigkdd software stephen structure structures supervised suppl systems task technical transforms tsuda ucsc university vandenberghe weiss with yair http://books.nips.cc/papers/files/nips20/NIPS2007_0423.pdf 171 Consistent Minimization of Clustering Objective Functions academie analysis anders annals appear applications arenas arts avoid barabasi belkin bench benchmarks bioinformatics biol botstein bound bousquet branch brown brusco bubeck bulletin cell centrality cerevisiae classification clustering collective combinatorial community comprehensive computing consistency consistent cosin cycle danon data devroye distribution dynamics eisen error exponential fast first fraunhofer free fritz functions futcher generalized genes giralt guilera guimera gutman gyorfi html http human hybridization identification ieee interactions inverse iyer jegelka jeong kaufmann laplacian learning lethality lugosi luxburg mason material math matrix means mejn microarray minimization mlearn mlrepository multiple natur nature nearest neighbor netdata network networks newman objective oltvai overfitting pattern personal phys pollard preprint probabilistic projects protein ratsch recognition references regulated repository saccharomyces scholkopf sciences self serbe sherlock shin similar small some spectral spellman springer stahl statistical statistics strogatz strong structure supplement supplementary theory trans tsuda tuebingen tutorial umich vapnik watts with world xiao yeast zhang http://books.nips.cc/papers/files/nips20/NIPS2007_1048.pdf 12 On Sparsity and Overcompleteness in Image Models algorithms annealed applied approximate based basis battle bayesian beal bell bishop cell cells code coding college compared component components comput computational computing cortex edge efficient emergence employed energy field filters gatsby hateren hinton icann images importance independent inference interpolation learning lond london mckay models natural nature neal neural neuroscience olshausen osindero overcomplete pages primary principal proc proceedings product properties rajat receptive references representations research sampling scene scenes schaaf sejnowski simple sparse statistics strategy thesis topographic unit university variational vision visual welling with http://books.nips.cc/papers/files/nips20/NIPS2007_0964.pdf 285 A Bayesian LDA-based model for semi-supervised part-of-speech tagging adaptation algorithms allocation analysis andrew approach aria banko bayesian bernard blei blitzer christopher coling collins constituent context contrastive correspondence cyclic data david dependency dirichlet discriminative distributional does domain driven eacl eisner emnlp english estimation experiments extraction feature fernando find finkel fully gibbs global goldwater good grammar grenager griffiths guessing haghighi hidden hinrich hofmann icassp incorporating induction information into jason jenny john johnson jordan journal klein kristina language latent learning linear local machine manning mark markov matsumoto mcdonald merialdo methods michael michele model models moore naacl nakagawa natural network nips noah part parts perceptron pereira probabilistic proceedings prototype references research rich robert rose ryan sampling schutze semantic sequence sharon smith speech structural systems taggers tagging tetsuji text theory thomas toutanova training trond unknown unlabeled unsupervised using with words yuji http://books.nips.cc/papers/files/nips20/NIPS2007_0922.pdf 105 Discriminative Batch Mode Active Learning active advances algorithm application applications artificial based batch bengio bennett brinker campbell categorization chen classification classifiers clustering cohn combining committee comparison computational conference content continuum cristianini data development diversity employing entropy error estimation european fields framework freund from functions gale gaussian ghahramani grandvalet graphical greiner harmonic hastie hernandez http icml ieee image import incorporating information intelligence international interplay joint jordan journal kernel knoblock koller labeled lafferty large learning less lewis logistic logreg machine machines margin mccallum medical microsoft minimization mining minka minton mode models more multi multimedia muslea mutual neural nguyen nigam nocedal numerical optimal optimistic optimization optimizers papers parrado pool proceedings processing query reduction references regression report representative research retrieval robust sampling scale schohn selective semi sequential seung shamir sigir smeulders smola springer statistical statistics supervised support systems technical text through tishby tong toward training trans tresp unlabeled using vector view wang wide with workshop world wright york zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0470.pdf 152 Bundle Methods for Machine Learning abbr above accuracy achieve additional adult advances aistats algorithm algorithms allows already also altun analysis analyze another applicable applications applies apply applying approach approximation arbitrary argue around arxiv assumption assumptions astro attained autos aviation back bagnell ball bertsekas between both bound boundary bounded boyd bundle cambridge care case cases ccat centered certain chain choice choices choose claim classification clearly close colt comparison component computationally compute computing concave concerning conclude conditional conditions confidence connection connections consequently considers constant constrained continuously converge convergence convex convexity corresponding cover covertype crossover dataset datasets decomposes decrease decreasing define defining definition denominator denote denotes density derivative derivatives descent describe designed difference differentiable differential dimension dimensional direction dual each easy editors efficient element eliminate empirical enjoy equality equation error essentially establish estimated estimation evaluate evaluating exact examples expanding expansion expansions expensive experiments exponential express extended fact families faster feasible fields figure finally finds first fixed following follows from function functional functions furthermore ganapathi given gradient gradients greedy guarantees guestrin hand have hence here hessian hiriart hofmann holds however hull icml idea ieee implies improved improvement increasing incremental individual inequality influenced information initialize inner instance interdependent intermediate interval into invoking iterations joachims kddcup know koller lagrange lagrangian large largely latter leading leads learn learning lemarechal lemma level lies like line linear linearly linesearch listed logarithm loop loss losses lower mach majorized making margin markov matrices maxima maximizew maximum maxx measures meets method methods might mild minima minimization minimize minimizer minimizes minimum mint modular monotonically more moreover most multivariate nature nedich need needed negative networks neural news next nocedal nonnegative nonsmooth notation note noting number numerical objective observe obtain obtaining occurs offset ones online only onto optimal optimality optimization other output over overload pages pardalos part partial parts past patterns pegasos perform performance performed performing perrms pessimistic phase phases pick plot plugging point potential precision prediction present press primal princeton problem problems proc processing progress projects proof proofs properties property proves provided provides purpose quadratic radius random range rate rates ratliff real rearranging references regularization regularized related relatively remaining remp rendering repeat reported reproducing research respect respective respew result results reuters rewrite risk rockafellar rule scalable scores search second section semilog sequential setting several shalev show showed shown shwartz simple simulated since singer size small smola smooth smoothness solution solve solver solves solving springer srebro starting statistical step steps stepsize stochastic strand strong structure structured study subgradient subject subsequently sufficiently support svmperf svms systems table takes taking taskar tasks taylor technical terms that their then theorem theory there these third this throughout thus time towards training trans tsochantaridis turn unattractive unconstrained under university until update upper urruty uryasev used using value values vandenberghe vanish vanishes vapnik variables various vector vectors vishwanathan weaker when whenever where which will with work would wright write written yields zhang zinkevich http://books.nips.cc/papers/files/nips20/NIPS2007_0959.pdf 24 Reinforcement Learning in Continuous Action Spaces through Sequential Monte Carlo Methods action actions actor adaptive alexander algorithms american andrew approx approximate artificial arulampalam ascent association athena australian automating autonomous baird barto base bayesian behavior belmont bertsekas cambridge carlo chen choice chris clapp coding conf conference continuous control critic cybernetics daniele david dedieu dimensional dynamic dynamical eric experiments filters force function fuzzy gaskett gaussian gordon gradient hado harry hasselt high ieee imation inference intelligence intelligent international intl introduction iros joint jose jouffe journal kimura klopf kobayashi konda laboratory learning leemon lnai machine marco maskell ment methods millan monte neil neural nonlinear ohio online optimization pages parameter part particle patterson peter peters policy posenato press problems proceedings processing programming references reinforce reinforcement report richard robotics sanjeev santamaria sara schaal scientific sequential sherstov siam signal simon spaces springer state statistical stefen stochastic stone sutton symposium system systems technical tile tracki trans tsitsiklis tutorial using verlag wettergreen wiering with wright zelins http://books.nips.cc/papers/files/nips20/NIPS2007_0917.pdf 0 Fitted Q-iteration in continuous action-space MDPs aamas academic academy accepted adprl american anthony antos approximating artificial automation bartlett barto based batch bellman bertsekas book bounds boyan bradford budapest cambridge capacity case colt complex complexity computer conference control cristianini data discrete domain dynamics efficient entropy ernst european experiences finite first fitted foundations function functional functions generalization geurts hungarian hungary ieee institute intelligence introduction iteration jordan journal kalyanakrishnan kende kernel known kolmogorov large learnability learning long machine machines mathematical mdps method methods minimization mode moore munos near network neural nips optimal other pages path pegasus policies policy pomdps press proceedings real references reinforcement report research residual riedmiller safely sample sampling sciences search sets shattering shawe shreve single society space stochastic stone support sutton system szepesvari taylor technical tewari theoretical tihomirov time trajectory translations tree uncertainty university value valued vector wehenkel williamson with york http://books.nips.cc/papers/files/nips20/NIPS2007_0607.pdf 245 Extending position/phase-shift tuning to motion energy neurons improves velocity discrimination above actually adelson ahumada along also america anzai architectures area around autocorrelation band based become been behavior belief bergen better between binocular border both boundary broad cassanello cast cell central changes chen circuits coding combining communication comparable comparisons complex computation computing consistent consistently constant constructed constructing content continuum correlation cortex course creating deangelis degree delbruck demonstrated depth detection detectors dimensions direction directionally discrimination disparity distinct doubt elaborated encoding energy evaluation evidence experimental explain extraction field fine fleet flow freeman frequency functional gratings have heeger here however human ideally ieee image indicate information inputs insect inseparable intermediate investigative journal known kral level lisberger macaque mechanism mechanisms method model models motion moving movshon navigation nervous networks neural neurally neuron neuronal neurons neurophysiology neuroscience obtained offset ohzawa opposite opthalmology optical optics orientation pair pairs perception perrone phase pixels plausible position positionshift potential poteser preferred previously priebe principle properties proposed pure qian recent receptive reference references reichardt relative reliably representation research responses results retina role rosenblith santen science seems selective sensing sensitive sensory separable shift shifts show sides silicon simoncelli simple simulating single society space spatial spatiotemporal speed sperling srinivasan stereo stereoscopic stimuli striate suggest suited supplement system systematic task temporal than that this thompson thought threshold time traditionally transactions truly tuned tuning upon using velocities velocity very vision visual wagner watson were which while whose wiley wise with york http://books.nips.cc/papers/files/nips20/NIPS2007_0703.pdf 35 Discriminative Keyword Selection Using Support Vector Machines academic advanced advances artificial attacks avrim barnhill becker bengio berkeley bernhard blum book cambridge campbell cancer carrasquillo cepstra cernocky christopher classification classifiers classify collobert computer confusion consortium corpora cortes data detection discriminative discriminatively entropic evaluation evermann examples features feng ferrer fundamentals gareth gauvain gene gish glass gleason gunnar guyon haffner hain hall hazen herbert hetherington hierarchical hori html http hung icassp icsi identification ieee information intelligence interspeech izhak james jean joachims jones journal juang kajarekar kernels kershaw kluwer konrad langley language large laskov lattices lawrence learning leek linguistic lkopf machine machines matejka mitll mllr models mohri moore navratil network networks neural neworks nist obermayer odell odyssey ollason open pavel performance petr phoneme phonetic phonotactics prentice press problems proc proceedings processing publishers quicknet rabiner rational recognition references regression relevant research retrieval reynolds richardson rieck ronan samy saul scale schwarz sebastian selection shafran shen shriberg singer speaker speech spoken stolcke structures support svmtorch switchboard system systems takaaki text thomas thrun timothy torres traffic trained transforms unknown upenn using utterance valtchev vapnik vector venkataraman virology vocabulary weston white with woodland word workshop yang young zhai http://books.nips.cc/papers/files/nips20/NIPS2007_0807.pdf 128 Computing Robust Counter-Strategies aaai abstraction acbf agent agents alberta algorithm algorithms analysis annals appear approximating april artificial association auer automated bandit based bianchi billings bowling burch carmel cesa competition competitive computation computer computing conference counter david davidson department distributed eighteenth equilibria equilibrium execution extensive fall finding finite fischer form full game games generating ghps gilpin gradient hoda hold holte incomplete information intelligence intelligent international item iterative johanson joint journal julia learning littman machine manuela markovitch martin massive master mathematics mccracken menlo method michael minimization modelling models multi multiarmed nash national neural news october opponent optimal pages park patrick pena peter piccione planning player poker press probabilistic problem proceedings processing real references regret report riley robinson robust safe sandholm scale schaeffer schauenberg scheduling science search seventh shaul sixth solving strategies strong symposium systems szafron technical texas theoretic theory thesis thirteenth through time twenty university veloso with zero zinkevich zjbp http://books.nips.cc/papers/files/nips20/NIPS2007_0296.pdf 14 Near-Maximum Entropy Models for Binary Neural Representations of Natural Images ackley activity algorithm algorithms american analyzing arxiv august barlow based berry bethge between bialek binary biometrika boltzmann bounding cambridge cases chain character chichilnisky coding cognitive complexity correlated correlation correlations current dependencies determining dimensional distribution divergence each editors effective elad emrich entropy exceeds factorial falls field firing formalism gaussian gauthier generating given grade grivich high higher hinton huber ieee images imply inference information intelligence intensity ising jaynes jonathan june karl large learning levine linear linn litke london machines mackay majesty maximum measured measures mechanisation mechanisms method michael model models multi multivariate natural nature network networks neural neurobiology neuron neurons neurosci nirenberg office only opinion order pages pairwise parallel patterns pearson percentage petrusca piedmonte population populations press primate problem processes qbio random real recorded reduction redundancy references removing retina ronen schneidman science segev sejnowski sensory shannon sheila sher shlens short some stand states stationery statistician strongly structure structures swendsen theory thought tkacik tractable trans tribus university variables variates victor wang weak wermuth where wherein which william with http://books.nips.cc/papers/files/nips20/NIPS2007_0672.pdf 196 Distributed Inference for Latent Dirichlet Allocation academy algorithm algorithms allocation american among association augmentation beal blei books bradski brockwell cambridge carlo chain clusters collaborative comp conference correlations data datar digital dirichlet distribution estimating faceted fetching filtering finding from garg google graph griffiths groups hierarchical http icml implementation international jmlr joint jordan journal kowalczyk latent learning libraries library machine markov mccallum microsoft mimno minka mixture models monte multicore national news newscast nips olukotun online organizing pachinko pages papers parallel personalization poor press proceedings processes rajaram reduce references related research scalable sciences scientific sharing simulation statistical stats steyvers structured subjects tanner topic topics vlassis volume wide world http://books.nips.cc/papers/files/nips20/NIPS2007_0260.pdf 194 Contraction Properties of VLSI Cooperative Competitive Neural Networks of Spiking Neurons abbott academic adaptive advances amari amplification analog analysis annual april arbib architectures array automatica bartolozzi based behavior biocas biological biomedical bistable books both cambridge chaos chapter charles chicca circuit circuits collective competition competitive computation computational conductance congress context contraction control cooperation cooperative cortical coupled current cybernetics dayan dependent digital distributed douglas dynamics editor editors electronic ermentrout eventcorrelation exist faugeras feature fields filter fire forbidden foundation fusi hahnloser hansel hofmann horn hybrid ieee indiveri information inspired integrate intelligence international jacques jean johnson journal letters linear lkopf local lohmiller mahowald march martin massachusetts mathematical matrix mattia methods metzler mitra mode modeling models modular nature neocortex nets network networks neural neuromorphic neuronal neurons neuroscience nonlinear oscillators pages partial permitted perseus plasticity platt power press proc proceedings process processing rate reduction references review reviews rich richard roger sarpeshkar sebastion selection selectivity sets seung signal slotine slow soltine somplinsky spike spiking stability strogatz switzerland symmetric synapses synaptic synchronization system systems theoretical theory thesis threshold timing tools transactions ultra university using vlsi volume wang winfried with world http://books.nips.cc/papers/files/nips20/NIPS2007_0056.pdf 225 Topmoumoute online natural gradient algorithm adaptive advanced amari architectures artificial backprop bengio bergstra berlin bottou bousquet collobert complexity computation conference cookbook courville curvature deep descent editors efficient efficiently empirical erhan evaluation factors fast fourth fukumizu gradient icml ieee intelligence international issues large larochelle layer learning lecture lectures lecun lnai luxburg machine many matrix method muller multi multilayer natural networks neural notes number order pages paris park pedersen perceptrons petersen problems products realizing references scale schraudolph second springer stochastic submitted thesis trade training tricks twenty universite variation vector verlag version with works yang http://books.nips.cc/papers/files/nips20/NIPS2007_0813.pdf 259 New Outer Bounds on the Marginal Polytope algorithms analyzing anonymous application applied approximate approximations barahona belief berkeley bethe bioinformatics borndorfer bounds chain chazelle circuit class combinatorial combinatorics cuts dept design determinant deza discrete electric empirical energy exponential families fields free freeman function geometry graph graphical graphs grotschel hall ieee inference information integer introduction issue jaakkola jmlr jordan july june junger kikuchi kingsford large laurent layout learning linear machine mahjoub marginal markov matchings material mathematical mathematics meltzer metrics mitsubishi models operations optimization partition physics planar polytope positioning prentice problems processing programming programs propagation random references reinelt relaxation relaxations report research scale september side signal singh solving special springer statistical statistics study supplementary technical theory transactions upper using variational volume wainwright weismantel weiss west willsky yanover yedidia http://books.nips.cc/papers/files/nips20/NIPS2007_0809.pdf 144 Structured Learning with Approximate Inference agreement algorithms andrew annual appear approximate artif artificial associative bayesian belief benefits bounds charles chatalbashev collective collins complexity computation computational conditional conference conll consistency constrained cooper daniel daphne data daume david discriminative distant eighteenth emnlp empirical entities estimating estimation experiments extraction fernando fields first formulation francisco generalization global graphical gregory hidden icml ieee ijcai inference information intell intelligence intelligent international jaakkola john joint jordan journal judea kaufmann kevin koller labeling lafferty language large learning limited linear loopy machine marcu margin markov martin massachusetts mcallester mccallum messagepassing methods michael model models morgan murphy natural networks note optimization output over page pages pearl perceptron pereira piecewise plausible predicting prediction press probabilistic proc proceedings processing programming propagation publishers punyakanok random reasoning references report research roth search segmentation segmenting selection sequence setting stochastic structured study sutton systems taskar tasks technical theory training transactions trees twenty uncertainty undirected university using vassil wainwright weiss willsky with wrong yair zimak http://books.nips.cc/papers/files/nips20/NIPS2007_0440.pdf 200 Heterogeneous Component Analysis advances analysis approximations aspremont aston bach bayesian bioinformatics bishop cambridge cancer cdna cell christopher component conference data estimation expression fuchioka full gene ghaoui goto hirata http information intermediate international ishii isogai jaakkola kaneko kubo learning machine matrix matsubara method microarray missing monden nabney nakagawa nakagawara nakamura ncrg netlab network neural neuroblastomas ohira pages path predicts press principal proceedings processing profile profiling prognosis rank references regularization risk sato software sparse specific srebro systems takemasa tumor using value weighted yamada yoshida http://books.nips.cc/papers/files/nips20/NIPS2007_1118.pdf 29 Sparse Feature Learning for Deep Belief Networks algorithm algorithms analysis autoencoders bakir balcan based basis belief bengio berkeley biology bottou boureau channels chapelle chopra codes coding computation conference contrastive cortical cost current data dayan decoste deep delgado description digits dimensionality divergence editors efficient employed energy exdb experts factorization fast field framework free greedy grouping hadsell handwritten helmholtz hinton http huang ieee image images journal kernel kreutz lamblin large larochelle layer learning lecun length lennie lewicki machine machines manifolds matrix minimizing minimum mnist model modeling models multiscale murray nature negative nets networks neural nips noisy objects olshausen osindero over overcomplete parts popovici poultney predicting press proc processing products projects ranzato reducing references representations research revow robust salakhutdinov sallee scale scaling science segbench sejnowski seung signal sparse statistics stats strategy structured theoretical towars training transactions tutorial unified unsupervised vision vlsi welling weston wise with yann zemel http://books.nips.cc/papers/files/nips20/NIPS2007_0892.pdf 67 Automatic Generation of Social Tags for Music Recommendation acoustic adaboost aggregate algorithm algorithms alistair artist audio audioscrobbler berenzweig bergstra berkeley boosting brian california casagrande classification collaborative computer conference confidence cooperative data described description ellis erhan evaluating evaluation experiments explaining exploring features filtering forum freund gold ground herlocker http ieee improved information international ismir john jonathan joseph justin kegl konstan large lawrence learning logan loren machine measures moffat morgan multiclass multimedia music musical pages perception predictions problem proceedings processing query quest rated recommendations recommender references retrieval riedl rifkin ryan scale schapire services shapire sigir signal similarity singer society space speech subjective supported syst systems terveen thirteenth trans truth using webservices whitman wiley with work workshop zobel http://books.nips.cc/papers/files/nips20/NIPS2007_0945.pdf 228 DRAFT. A revised version will appear in NIPS 2007. advances algorithm algorithms andrew application approximate back bayesian becker belief benedetti bengio bloch bottou breese cambridge candela chapelle class cohen computation conf constraints contrastive covariance daphne data decoste deep dietterich digit dimensionality discriminant distance divergence editors embedding estimating estimation expectation experts exponential extractor family fast feature fisher francisco from functions gaussian generative geoffrey ghahramani graph greedy handwritten harmoniums hinton icml inference information international jack john jordan journal kandola kaufmann kernel kernels koller label lafferty lamblin large larochelle lauer lawrence layer learning local machine machines minimizing minka models moore morgan neighbourhood nets networks neural nips noise nonlinear nonparametric osindero pages pattern popovici presence preservation preserving press proc processes processing products propagation publishers quinonero rasmussen recognition reducing references regression retrieval rosen royal salakhutdinov scale scaling scholkopf science seeger semi series simon society statistical statistics structure suen supervised suzanna syst systems theory thomas through towards trainable training transforms vapnik volume welling weston whye wiley william williams wise with xiaojin zien zoubin http://books.nips.cc/papers/files/nips20/NIPS2007_1121.pdf 115 Trans-dimensional MCMC for Bayesian Policy Learning acting american analysis andrieu artificial assoc athena attias autonomous bartlett based baxter bayesian berger bertsekas biometrika briers cambridge carlo chain coates components computation conf conference continuous control cowan cued dayan decision department design determination diel dimensional discrete doucet dynamic edinburgh editors efficient engineering environments equations estimation experimental fast flight freitas ganapathi gradient green harmeling helicopter highly hinton horizon ieee infeng inference infinite informatics information inhomogeneous integral intelligence intelligent international introduction inverted iorio iteration jordan journal jump klaas large lation lawrence learning leen liang machine markov maskell mcmc mdps method methods million mixtures model monte motor muller neural number optimal pages particle particles pegasus peters planning point policy pomdps porta poupart press probabilistic processes processing programming references reinforcement report research reversible richardson robotics robots royal russell sanso schaal school schulte scientific search simu simulation smoothing society solla solving spaan stat state statistical statistics stochastic storkey structured symposium systems tadic technical thrun toussaint trans uncertain uncertainty university unknown using value verma vlassis with http://books.nips.cc/papers/files/nips20/NIPS2007_0906.pdf 279 Managing Power Consumption and Performance of Computing Systems Using Reinforcement Learning abbeel adaptive aerobatic agency agents algorithms allocation almeida antos application applications apprenticeship approach approximation appserv autonomic baird based behavior bellman bennani berkeley boosting capacity center centers chen clusters coates colt computer computing conf consortium control cooperative costs data datacenter decomposition deployment distributed energy energystar enterprise environmental evaluation exploration extend extended femal fitted flight freeh function gautam green grid guez hall helicopter hosting http hybrid icac icml implications internet intl iteration jong kandasamy lagoudakis learning least letter machine management managing manufacturers measurements menasce methodologies methods metrics minimization modeling models munos near nips operational optimal other pages parr path performance periodicity planning policies policy power prediction prentice presentation proc protection quigley references reinforcement research residual resource russell sample second server single sivasubramaniam software squares squillante stakeholders states system systems szepesvri tail tesauro thegreengrid third through traffic uniform united wang webservers websphere with zhang zimdars http://books.nips.cc/papers/files/nips20/NIPS2007_0492.pdf 257 Colored Maximum Variance Unfolding advances algorithmic analysis bach banff bedo berlin borgwardt bousquet boyd canada clustering component conf conference connection dependence diaconis dimensionality editors estimation fastest feature fukumizu germany goldberger graph gretton hilbert hilbertschmidt hinton information international intl jain jordan kernel laplacian large learn learning mach machine markove matrix maximization maximum measuring mixing neighbourhood neural nonlinear norms pages problem proc proceedings process processing programming reduction references regularization reproducing review roweis salakhutdinov saul scale scholkopf selection semidefinte siam simon smola song spaces springer statistical supervised systems theory tomita unfolding variance verlag view weinberger with xiao http://books.nips.cc/papers/files/nips20/NIPS2007_0925.pdf 226 Learning the 2-D Topology of Images aaai algorithms applied architecture artificial audio backpropagation based bengio berlin boser boston bottou carnegie chapelle classification code complexity computation computer conference construction cook data decoste delay denker dependences development diego dimensionality distinctive document editors embedding empirical enhancement entropy estimation features framework from genre geometric global gradient haffner handwritten henderson hinton howard hubbard ieee image images intelligence international introduction invariant jackel journal kernel keypoints lang langford large learning lecun lewicki linear locally lowe machines maximum mellon mixture models modular musical national natural network networks neural nonlinear november osindero pages physics press probability proc proceedings processing product recognition reduction references report roweis saul scale scaling scene science segmentation signals silva speech springer statistics technical tenenbaum time topographic towards trans transactions tzanetakis unfolding universal university unsupervised using vapnik variance verlag versus view vision waibel weinberger welling weston workshop http://books.nips.cc/papers/files/nips20/NIPS2007_0471.pdf 223 GRIFT: A graphical model for inferring visual classification features from human data ahumada analysis associates band bayesian bennett bishop british bubbles bulletin carlin category chapman classification cohen component configural creelman data detection erlbaum estimation face faces farell features filtered from gelman gold gosselin guide hall human ideal identification image inducing inefficiency information internal into investigation journal lawrence learning letters level machine macmillan moore nature networks neural noise observers oxford palmer pass pattern pelli perception phenomenology photons press processes psychology psychonomics recognition references remarkable representations research reveal reveals review ross rubin schyns science sekuler sergent shiffrin springer stern tasks technique theory underlying university user vision visual weights word http://books.nips.cc/papers/files/nips20/NIPS2007_0695.pdf 107 Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria adaptive agarwal algorithm algorithms applications approximation argument arora ascent bayes behavior blum chen class colell colt compact complexity comput computing contributions convex correlated cover daskalakis deng descent dresher econometrica economic editors equilibria equilibrium existence exponentiated external finance focs freund from game games general generalized goldberg gradient greenwald hannan hart hazan icml inefficient infinitesimal internal jafari kalai kale kivinen leading learning line linear logarithmic lugosi machine mansour manuscript math mathematics meta method multiplicative nash online operations optimization other pages papadimitriou parity play player playing portfolio portfolios predictors procedure programming proofs references regret repeated research risk schapire schmeidler selection sets settling simple smoothed stoc stoltz strategies syst teng theoretic theory tucker universal update using versus volume warmuth weights with wolfe zinkevich http://books.nips.cc/papers/files/nips20/NIPS2007_0170.pdf 168 An online Hebbian learning rule that performs Independent Component Analysis activity algorithm analysis analyzer annual based belouchrani biol blind cardoso circuits cocktail coding coincidence combining complexity component components computation conf correlated correlations delayed demo dentritic dependent depends efficacy efficient epsps fastica froemke from frotscher gavert gerstner hebb hemmen higher hopfield http huang hurri hyvaerinen hyvarinen identifiability identification ieee independent indeterminacy information interesting interscience jade karhunen kempter learning lett location lubke markram math meraim millisecond mixture model modification molgedey moulines mueller muller nature neur neural neuron neuronal neuroscience noise object olfactory order party perception philips phys plasticity pnas postsynaptic postulate principal proc processes projects pursuit references regulation review revisited rule sakmann sarela schuster science second separating separation series signals simplified soon source spike statistics stochastic structure synaptic systems tdsep technique temporal time timing tong trans using wagner wiley with workshop ziehe http://books.nips.cc/papers/files/nips20/NIPS2007_1047.pdf 277 Convex Learning with Invariances advances adversarial algorithms altun architectures based bhattacharyya bottou brunot burges caelli cambridge classification classifying comparison cone conference convex cortes cowan dalvi data decoste deletion denker digit distance domingos drucker editors efficient estimated europe feature ferraro fogelman formulation from gallinari geometry giles globerson gradient graepel groups guestrin guyon handwritten hanson herbrich hinton hints hofmann icann icml integral interdependent invariance invariant jackel joachims kernel koller laguages large learn learning lecun linear mach machine machines margin markov massively mausam method methods minimization missing modular mostafa muller networks nightmare nips order output pages pannagadatta parallel pattern pegasos press primal proceedings programming recognition references regularized risk robust roweis sackinger sanghai saul scalable scholkopf second semidefinite shalev shwartz simard singer smola solver soulie spatial springer srebro structured support svms taskar test thrun time training transformation transforms translation tsochantaridis using vapnik variables vector verma vishwanathan vision weiss http://books.nips.cc/papers/files/nips20/NIPS2007_0238.pdf 92 On Higher-Order Perceptron Algorithms abound about accuracy achieved active advice algorithm algorithms alizadeh also analysis angluin approximate artificial associated attributes auer automata azoury based best bianchi binary bold bordes bottou bounds breast budget cancer case categories cell cesa classification classifiers colt combinations comparison competitive computation computing concept conconi convergence corpus corrections corresponding cortes dataset dekel denotes density derived diffuse digit discriminant discrimination disjunction distinct distributions dual during each entropy ertekin estimation estrogen experimental expert exponential expression familiy fast figures fixed forgetron four fraction freund from gaussian gene general gentile gives grove gruvberger handwritten haussler helmbold http icann identified information input intelligence international irrelevant jmlr journal kernel kernels kivinen large learning line linear linearthreshold littlestone logarithmic long loss lymphoma machine majority margin mathematical matrix maximal maximum meets misclassified mistake mnist nature networks nips norm novikov number online only optimization order over parentheses patterns perceptron perceptrons phase polynomial press proc profiling proofs queries quickly receptor recognition references relative relaxed relevant remarkably reported researchandstandards results reuters review robustness sampling schapire schoelkopf schuurmans second selective shalev shown shwartz siam singer smallest smola sparse statistical statistics status summed support symposium table tasks test theory threshold total tracking train training type types updates usps vapnik variables vector version vovk warmuth weighted weston when while winnow with worst zaniboni http://books.nips.cc/papers/files/nips20/NIPS2007_0849.pdf 154 Non-Parametric Modeling of Partially Ranked Data advances analyzing based biometrika cambridge combinatorics conditional correlation critchlow data distance enumerative fligner information journal kendall lafferty lebanon lecture mallows marden measure methods metric modeling models neural notes null partially poset press processing rank ranked ranking references royal society springer stanley statistical statistics systems university verducci volume http://books.nips.cc/papers/files/nips20/NIPS2007_0565.pdf 61 Measuring Neural Synchrony by Message Passing abeles abnormalities academy advances algorithms alzheimer amari analysis annals application approach april assessment aviyente bakardjian based basis behaving bell bergman bezerianos bhattacharya binding biology biomedical biophysical blood brain breakspear busch cambridge cardiorespiratory carmeli case causal cerebral chapman chapter cichocki cimponeriu clinical coherence comparative comprehensive comput computation computational connected connectivity consciousness considerations corr correlation cortex cortical coupling critical cross data different direction disease dreyfus dubois dynamic dynamical dynamics early edited electric emerging empirical engineering entropy estimating estimator event evolution factor feng ffdtf field fields firing flow frequency frontal gervais graphs grassberger grigutsch haddad hall handbook handy herrmann higher hilbert hualou human icassp identification ieee indicate influence information innocenti instantaneous interaction interactions interdependence introduction jensen jian jianfeng jong journal kaminski kernel knyazeva kraskov kreuz kullback lachaux learning leibler letters liang loeliger machine magazine mann mapping maps march margalit martin martinerie mathematical matsuda measure measures measuring medicine metabolic methods metric monkeys mrowka multivariate mutual myers nakahara network networks neural neurobiology neuroimage neuroinformatics neuron neurons neurophsyiological neurophysics neurophysiol neurophysiology neuroscience neurosignal nonlinear nucl nunez order oscillations oxford partial patients patterns patzak pereda performance period phase philadelphia phys physical plane pool potentials prediction press principe problem proc processing progress purpura quenet quiroga rabiner real recognition references related renyi reproducing respectively review robinson rodriguez rosenblum sakai sciences sensitivity sept september series several shannon signal signals singer space spatiotemporal spike spur srinivasan stam state stogbauer study submitted synchronization synchronous synchrony system systems table technical test theoretical theory three time todd trains transactions university vaadia value values varela variability vialatte victor warping wave wavelet whitney with word york http://books.nips.cc/papers/files/nips20/NIPS2007_0293.pdf 148 Statistical Analysis of Semi-Supervised Regression advances aistat annals artificial arxiv assumption asymptotic berkeley bounds classification classified cluster colt comparison conference consistency cross data department dimension efficiencies error estimation fields functions gaussian generalization global graphs harmonic icml ieee info information intelligence international intrinsic kernels labeled large learning likelihood linear literature local machine manifold manifolds math maximum minimax mixing neural nips nonparametric parameter partial partially pattern polynomial proc proceedings processing randomized recognition references regression regularization relative review samples scale semi smoothers sparsified statist statistics supervised systems tech tenth their theory training trans transductive under university unknown unlabeled using validation value wisconsin with workshop http://books.nips.cc/papers/files/nips20/NIPS2007_0614.pdf 65 Efficient multiple hyperparameter learning for log-linear models accelerated acids adaptation adaptive aistats algorithms alignment alonso analysis andersen anguita annotating aphical approaches approximate approximation barber based bateman batzoglou bayesian bengio bethe bioinformatics bound bousquet carreras chapelle chen choosing classification classifiers coding collins comp complete complex computation computing conditional conference conjugate contrafold contralign criteria cross crossvalidation cybernetics data derivative descent design discriminative duan eddy efficient eigenmann error evaluation exact expectation exponentiated fast faster feature field fields gaussian general genomes ghahramani glasmachers globerson goutte gradient graph griffiths gross hagan hansen hessian hierarchic hintz hyperparameter hyperparameters icassp icml ieee igel ijcnn inference intelligence intelligent interpolation invariance iterative jones kapoor keerthi kernel kernels khanna kitakoshi kobayashi labeling lafferty laplace large larsen learning linear machine machines mackay madsen margin marshall martins math mccallum mcmc measures meta method methods minimizing minka modeling models moxon mukherjee multiple multiplication murphy murray naacl nakano neal netwo network networks neural neurocomputing nips nnsp nocedal nossek nucleic numerical ohlsson optimal optimization optimize overfitting page pages parameters parise parsing pattern pearlmutter pereira performance physics picard prediction predictive preventing probabilistic processes propagation protein radius random recomb references regularization rfam ridella rivieccio rnas rotational scale schmidt schradolph secondary seeger segmenting selection semi semisupervised sequence shallow simple sindhwani softw springer statistics step stochastic structure structured sturdza sundararajan supervised support svarer systems szummer takeuchi trade training trans transaction transactions tricks tuning undirected using validation vapnik vector viswanathan wellings williams with without woods wright zhang zunino http://books.nips.cc/papers/files/nips20/NIPS2007_0602.pdf 186 Learning to classify complex patterns using a VLSI network of spiking neurons abbott address advances analog analysis array arthur avlsi badoni bartolozzi based better between biocas biomedical bistable boahen bounded brader cambridge capacity chicca chip chips circuits classification complexity computation connectivity correlated dante decisions delbruck dependent douglas driven dynamics editor editors events everything fawcett fire fusi giudice giulioni gutig ieee indiveri information integrate international introduction iscas kaufmann lazzaro learn learning learns legenstein letters lichtsteiner limits maass mahowald mateo mead memories memory mitra modeling morgan multi nager nature necessary network networks neural neuromorphic neuron neurons neuroscience only orientation pages pattern patterns plastic plasticity platt point power press proc proceedings processing real recognition reconfigurable recurrent references robust ryckebusch scholkopf selectivity senn silicon sompolinsky spike spiking stimuli storage symposium synapses synaptic system systems take tempotron that timing touretzky transactions using vlsi volume weiss what when winner with world http://books.nips.cc/papers/files/nips20/NIPS2007_0197.pdf 190 Stability Bounds for Non-i.i.d. Processes adaptive advances alex alexander algorithm algorithmic algorithms andre annals applications april artificial assumptions aurelie bernhard bernstein boosting bounds bousquet calcul cambridge chaotic check computational computer concentration conference consistency convergence craig crossvalidation dana davide dependantes dependent devroye distribution doukhan dual dynamic elisseeff empirical estimation examples extension fifteenth free function gammerman generalization gunnar haykin icann ieee inequalities information international interscience jens journal kaufmann kavita kearns kernel kernels klaus kohlmorgen kontorovich kulkarni learing learning leave lecture limite lozano machine machines martingale masry math mathukumalli mattera meir method methods michael mixing model modha morgan muller networks neural nips nonparametric notes observations olivier pages paul performance potential predicting prediction press probabilites probability proceedings processes processing properties publishers quantites ramanan random rates ratsch reconstruction references regression regularized research ridge robert rules sanity sanjeev saunders scholkopf science selection sequences series shapire simon smola sommes springer stability stationary statistical support system systems theoreme theory through time transactions under vapnik variables vector verlag vidyasagar vladimir volodya volume vovk wagner wiley with york http://books.nips.cc/papers/files/nips20/NIPS2007_0067.pdf 201 Variational inference for Markov jump processes academy adam advanced alon andrew annals appear approximation approximations archambeau arkin artificial available bayesian biology biometrics bounds boys cambridge cedric cells chapman chemical chemistry clock conference cornford coupled daniel darren david differential diffusion discretely dynamical editors equations eric errors exact expression field friedman from gaussian gene gillespie golightly grammars hall harley haussler hiroki hitoshi html http imaging individual inference intelligence introduction john journal kageyama kenichi kinetic kirkwood learning letters level london long machine manfred masamizu mathematics mcadams mean mechanics mechanisms mesoderm methods mjolsness model models molecule nagahara national nature observed ohtsuka okamura opper oscillators physical predictive presomitic press proceedings process protein reactions real references research revelation review richard ryoichiro saad sciences segmentation semantics shawe simulation single somite staff statistical stochastic sunney supervised systems takashima takenaka taylor thomas time toshiyuki unstable using wilkinson workshop yoshikawa yoshiki yoshiko yoshito yosiphon http://books.nips.cc/papers/files/nips20/NIPS2007_0879.pdf 136 Privacy-Preserving Belief Propagation and Sampling actions american analysis artificial axioms bayesian belief biometrika bishop bounding cambridge casella communication computing convergence correlated crypto cryptographic cryptography distributions dodis effects errors evaluation example explaining exploring financial fisher foundations freeman function game geman generalizations george gibbs goldreich graphical halevi ieee ihler image images inference intelligence intelligent intractability journal kaufmann kearns learning littman loopy machine message millennium models morgan naor networks nissim pages pattern pearl plausible preserving press probabilistic probability problem propagation protocols quadratic rabin random reasoning recognition recognizing references relaxation research residues restoration sampler secure selecting shafer shenoy singh solution springer statistician stochastic symposium systems teague theoretic theory time transactions uncertainty understanding university volume weiss willsky would yedidia http://books.nips.cc/papers/files/nips20/NIPS2007_0429.pdf 36 Optimal ROC Curve for a Combination of Classifiers algorithm alto annals artificial august bagging bari bartlett bernard best better blake boosting breiman character classification classifiers combining complex computer concavities conference considerations containing curves data databases detection dietterich discovery dzeroski edition effectiveness efficient ensemble environments estimation euler experiments explanation fawcett flach foster freund generalization graphs hettich html http hypotheses ijcai imprecise intelligence international introduction italy iyer january jmlr joint journal kaufmann klinkenberg knowledge laboratories learning lecture london machine march margin mathematical merz methods mierswa mining mlearn mlrepository morgan most networks neural newman neyman notes october pages palo papers pearson peter philosophical physical poor practical predictors preferences problem proceedings prototyping provost rapid repairing report repository research researchers robert robust royal saso schapire scholz science second selecting series shaomin sigkdd signal singer society springer stacked stacking statistical statistics tasks technical tests than thirteenth thomas transactions updated verlag vincent voting with wolpert wurst yale yoav yoram zenko http://books.nips.cc/papers/files/nips20/NIPS2007_0178.pdf 59 A general agnostic active learning algorithm active agnostic algorithm algorithms analysis applications artificial atlas balcan based beygelzimer boucheron bound bounds bousquet broder case castro chervonenkis coarse cohn colt committee communication complexity computer computing concepts conference constraints control convergence dasgupta dimension djhsu efficient events focs frequencies freund general generalization guruswami halfspaces hanneke hardness http icml improving inen intel intelligence introduction kalai label laboratory ladner langford learning lecture lerton ligence lower lugosi machine margin minimax monteleoni nips noise notes nowak online open papers perceptron probabilities probability problem query raghavendra realizable references relative report sample sampling science selective seung shamir shifting statistical teaching technical their theory thesis tishby ucsd uniform upper using vapnik with zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0102.pdf 295 Spatial Latent Dirichlet Allocation academy action activity allocation artificial aspect author authors bayesian blei bmvc categories categorization classification coherent collections concurrent correlated criminisi csail cvpr data dictionary dirichlet discover discovering documents dynamic efros examples experimental extent field figure finding freeman griffiths grimson hierarchical html http human iccv icml image images intelligence jordan journal lafferty latent learned learning machine markov minka model models msrc multiple national natural niebles nips object objects original parts people perception perona proc references region research results rosen russell scene scenes sciences scientific segmentation segmentations sivic slda smyth spatially spatialtemporal steyvers sudderth their topic topics torralba triggs uncertainty universal unsupervised using verbeek visual wang willsky winn with words xgwang zisserman http://books.nips.cc/papers/files/nips20/NIPS2007_1072.pdf 236 Multiple-Instance Active Learning acids active advances andrews approximate artificial atlas axis based biology blake bult catlett cohn combining community comparison conference continuum counting craven data database dietterich empirical eppig fields framework from functions gaussian generalization generalized genes genome ghahramani goldman group harmonic heterogeneous hofmann http icml improving informatics information instance intelligence international kadin kaufmann labeled ladner lafferty lathrop learning lewis lozano machine machines maron members mice missl morgan mouse multiple neural nips nocedal nucleic numerical optimization pages parallel perez press problem proceedings processing rahmani rectangles references research resource richardson sampling scott semi solving springer supervised support systems tsochantaridis uncertainty unlabeled using vector versus vinodchandran with workshop wright http://books.nips.cc/papers/files/nips20/NIPS2007_0854.pdf 122 Efficient Inference for Distributions on Permutations aistats algebraic algorithm american analysis association available boyen bradski cambridge certain columbia combinatorics complex control course data diaconis distributed fast filter finite form fourier group guibas howard http identities inference information institute ipsn irreducible ivanov jebara journal kaur koller kondor kronecker library lint managing markov mathematical mathematics merl mixed modality multi murnaghan networks nips object observable olukotun partially people press probability processes product references report representations risi schumitsch sensor shin snob sorokin state statistics stochastic structure symmetric systems target technical thrun tracking tractable transforms university willsky wilson wireless with wren zhao http://books.nips.cc/papers/files/nips20/NIPS2007_0665.pdf 262 Modelling motion primitives and their timing in biologically executed movements advances aimed amit artificial attractor audio automation avella barber based behavior behaviors biol bizzi cambridge cemgil combination combinations conf construction control cord corrections cursive cybern data digits dynamical encoding extracting factorial flanagan forcefield forward frog from generative ghahramani giszter handwriting handwritten hidden hinton icann icra ieee ijcai ijspeert images infer inferring information intel inverse isrr ivaldi jordan kappen kargo kawato landscapes learning ligence loeb machine markov matari model models modular motion motor movement movements multiple muscle music mussa nair nakanishi natural nature networks neural neurosci neuroscience neurosciences neuroscientist nips organization paired parametric perspectives pnas press primitive primitives problems proc processing programs rapid references representation robotics saltiel schaal shared singer specific speech spinal storkey synergies systems timing tishby toussaint transactions transcription trends trensch unpartitioned williams wolpert http://books.nips.cc/papers/files/nips20/NIPS2007_0580.pdf 299 Stable Dual Dynamic Programming adprl advances algorithms analysis applic approximate approximating approximation athena automat baird barto bertsekas bowling boyan coarse coding conference control decision difference discrete dual dynamic examples existence farias fixed function generalization ieee information international introduction iteration learning machine markov moore neural neuro nips optimal optimization pages points press proceeding processes processing programming puterman references reinforcement representations residual safely schuurmans scientific sparse successful sutton symposium systems temporal theory trans tsitsiklis using value volume wang wiley with http://books.nips.cc/papers/files/nips20/NIPS2007_0327.pdf 178 Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations aaai above acknowledgments additionally address after algorithmic alphabet also andrieu annual applications approach approximation approximations arnaud artificial based baxter bayesian best between bias blake breiman brendan caruana christophe cilibrasi clear clustering combination comments comparisons complexity compression compressor compressors computer conditional conference confirmation constructive convergence course cross data databases david defined different discussions distribution domain doucet edition elaborate elegantly estimating even experiments exploiting finding first flavor forests form freitas fruitful function functions general generalized give good gzip hassan hence hettich hope hutter huynh hypotheses hypothesis ideas ieee include induction inductive information input intelligence international introduction jonathan jordan journal juba just kiran knowledge kolmogorov lakkaraju last learning length like lilyana logic loss machine mahmud mapping march marcus markov matthew mcmc measure merz methods michael mihalkova ming model mooney more multiple multitask nando national neal networks newman nips optimality output over paper particularly paul perform performance peter powerful practical prediction press problem proceedings radford random rather raymond reba recent references reinforcement relatedness repository representations research revising rich rule samarth schuller science shai similarity solomonoff solves space spaces specific springerverlag standard stone string structural structured such suggests swarup sylvian systems task tasks taylor thank that then theorems theoretical theory these this transactions transfer tutorial tuyen unifies universal using various vitanyi where will wish works would york http://books.nips.cc/papers/files/nips20/NIPS2007_1021.pdf 49 Efficient Principled Learning of Thin Junction Trees abbeel acquisition alarm algebraic algorithm approximating approximation arnborg automated bach based bayesian beinlich belief bilmes bounded cald carnegie case causation center chan chavez choi chow colt complexity conf cooper corneil cowell darwiche data dawid deletion dependence deshpande discovery discrete distributions driven dynamic edge effective embeddings euro expert factor finding functions glymour graphical graphs guestrin hellerstein hoffgen hong ieee inference information jmlr jordan journal junction karger koller krause lauritzen learning madden markov math maximum medicine meila mellon methods minimizing mixtures model models monitoring moore narasimhan near network networks nips nonmyopic optimal ordering polynomial prediction press probabilistic probability probablistic product programming proskurowski queyranne references report robust sample scheines science search sensor siam simple singh soda spiegelhalter spirtes springer srebro statistics study submodular suermondt symmetric system systems technical techniques teyssier theory thin time transactions tree trees university value vldb width with http://books.nips.cc/papers/files/nips20/NIPS2007_0294.pdf 16 Incremental Natural Actor-Critic Algorithms actor advances algorithms amherst anderson approximation artificial assignment bagnell bartlett barto based baxter conference connectionist control covariant credit critic cybernetics decision differences difficult dissertation doctoral eighteenth elements estimates estimation european following function gradient greensmith horizon ieee infinite information intelligence international introduction joint journal kakade konda learning like machine mansour marbach markov massachusetts mcallester methods natural neural neuron nips peters policy predict press problems proceedings processes processing reduction references reinforcement research schaal schneider search simple simulated singh sixteenth solve statistical sutton systems techniques temporal that transaction tsitsiklis university variance vijayakumar williams with http://books.nips.cc/papers/files/nips20/NIPS2007_0103.pdf 76 EEG-Based Brain-Computer Interaction: Improved Accuracy by Automatic Single-Trial Error Detection actuated analysis antisaccade artificial automatic awareness babiloni band based basic basis biological biomedical birbaumer blankertz blom boosting brain carducci cincotti classification clinical coles commands common communication computer computing conf constructed control correction correlates cramon curio demonstration desynchronization details detection differently dopamine dorn dornhege editors electroencephalogram electromagnetic engineering error errors estimates european event evidence evoked experimental fast feature ferrez fiehler findings from gerson gerstner head hege high hinterberger holroyd human ieee imaging improved improves intelligence interaction interface interfaces interfacing invasive joint journal kohlmorgen krepki kunzmann laplacian learning locche lopes losch machine magnetic marqui mcfarland medical methods millan mobile model monitoring motor mourino muller negativity neural neuroanatomical neurophysiology neuroscience nieuwenhuis paced pages parra pascual performance pfurtscheller pharmacology potential potentials presence press principles proc processing psychological psychophysiology rates real realistic references regression rehabilitation reinforcement related renkens resolution resonance response review rhythm ridderinkhof robot rossini sajda schafer schalk selection sensorimotor silva single sloreta somatosensory source spence standardized subject substrate synchronization systems task technical there time tomography toward transactions transformed trial ullsperger using vaughan waves wolpaw wolpow wrong http://books.nips.cc/papers/files/nips20/NIPS2007_0140.pdf 253 Ensemble Clustering using Semidefinite Programming aaai aggregating aggregation ailon algorithm algorithms approach approximating approximation artificial bansal based biomedical biometrics bipartite blum boyd brodley buffalo cacsd cambridge charikar chawla class classification cluster clustering combinatorial combining comput computation computer computing cones conference consensus convex correlation data dimensional discovery engineering ensemble ensembles euclidean expression fern filkov foundations framework gasieniec gene geometric ghosh gionis golub gordon graph guruswami hamming henderson high inconsistent information integrating intelligence international isic jansson journal knowledge learn learning lingas lofberg mach machine mannila matching matlab means mesirov method methods microarray modeling monti newman optimization over page pages partitioning partitionings pattern peng press problems proc proceedings programming projection qualitative random ranking references resampling reuse science sedumi semidefinite september several siam singh skiena software solving squares state strehl sturm symmetric symposium syst tamayo theory thesis toolbox tools tsaparas type university using vandenberghe visualization wirth with yalmip york http://books.nips.cc/papers/files/nips20/NIPS2007_0737.pdf 306 Discriminative K-means for Clustering academic adaptive analysis austin bartlett belkin beyond blake boyd chapelle classification cluster clustering component computations computer cristianini cvpr data databases department dhillon dimension dimensionality ding discriminant discriminative distance edition eigenmaps embedding frade friedman fukunaga gaussian ghaoui golub graph guan hopkins icml introduction jasa jmlr johns jolliffe jordan kanade kernel kernels kulis lanckriet laplacian learning linear loan locally machine machines matrix means merz metric nips niyogi nonlinear optimization pages partitioning pattern press principal processes programming rasmussen reduction references regularization regularized report repository representation review roweis saul scholkopf science sciences semi semidefinite siam smola spectral springer statistical supervised support technical texas torre unified univ university using vandenberghe vector view williams with zhao zien http://books.nips.cc/papers/files/nips20/NIPS2007_0344.pdf 218 Retrieved context and the discovery of semantic structure acquisition across adaptive allocation amnesia analyses analysis anonymous associative becker behavioral behavioural bilateral biological blei brain bunsey burgess byrne codes cognition cognitive common complementary comprehensive connectionist conservation context cortico damage datey declarative developmental dirichlet discenna dissociations distributed domains double dumais editor eichenbaum elements elman elsevier episodic explanation extensive failures finding fotedar from function future gadian gluck griffiths growth hasselmo hippocampal hippocampus howard humans imagery imagining incidental indexing induction insights interaction jordan journal kahana khadem knowledge landauer large latent learning lists lobe london machine mathematical mcclelland mcnaughton meaning mechanisms medial mediators meeter memory mishkin model models moscovitch murdock myers names nature navigation neocortex networks neural neurocomputational neuropsychology neuroscience oxford past person philosophical plato postmorbid press problem processes psychological psychology rats reference references reilly relational remembering representation research review roediger royal scale science sciences semantic series slamecka society solution spatial statistical steyvers stimulus structure successes syndrome systems temporal tenenbaum teyler theory there time todam topics toward transactions tulving vargha westmacott with without words york http://books.nips.cc/papers/files/nips20/NIPS2007_0613.pdf 269 Hierarchical Penalization adaptive advances angle annals applied bandwidth bandwidths bioinformatics blake canu combined computational contribution cristianini data databases delve dual economic efron estimated estimation evaluating experiments feature figure framework function fusion genomic grandvalet graphical grouped hardle hastie hettich hierarchical html http information isolated johnstone jordan journal june kernel lanckriet lasso learning least line machine merz mlearn mlrepository model monographs motorcycle neural newman noble nonparametric osborne partial penalization points presnell press processing references regression repository represent represents residuals responses royal scaling selection series shrinkage smoothing society solid statistical statistics svms systems tibshirani toronto turlach valid variables volume with yuan http://books.nips.cc/papers/files/nips20/NIPS2007_1003.pdf 255 The Value of Labeled and Unlabeled Examples when the Model is Imperfect adaptation aggregation annual artificial audibert balcan belkin berlin blum bounds castelli chapelle classification classifiers cluster clustering combining complexity computer conditions conference convergence cover dasgupta data december density department devroye estimators examples fast from generalization gyorfi heidelberg ieee information intelligence international invited issue kernels labeled learning literature littman lugosi machine madison manifolds manuscript margin mcallester minimax mitchell mixing mixture model nips niyogi nonparametric optimal parameters parametric part pattern plug probabilistic rate rates ratsaby recognition references relative report riemannian samples scholkopf science selection semi separation side special springer statist statistical statistics style supervised survey technical theory thesis training trans tsybakov under university unknown unlabeld unlabeled unpublished values vapnik venkatesh weston wiley wisconsin with workshop yang york zien http://books.nips.cc/papers/files/nips20/NIPS2007_1045.pdf 118 Learning Monotonic Transformations for Classification advances artificial bartlett based bousquet boyd brown cambridge chapelle christianini classification conference control convergent convex cortes cristianini data decision definite dietterich editors expression gene ghaoui grundy hafner haussler hein hilbertian histogram howard ieee information intel jebara jordan journal kernel kernels kondor lanckriet lasserre learning leen ligence machine machines matrix measures metrics microarray moghaddam networks neural nonconvex optimization pages positive press probability proceedings processing product programming programs quadratic references relaxations research semidefinite statistics sugnet support thomas todd transactions tresp university vandenberghe vapnik vector volker with yang http://books.nips.cc/papers/files/nips20/NIPS2007_0751.pdf 251 Hidden Common Cause Relations in Relational Learning aaai aggregation algorithm algorithms american ancestral annals approximate association automating bach based bayesian bias classification conditional conference conic construction craven data dipasquo duality efficient equations estimating extract family fields freitag from gaussian getoor ghahramani graph graphical inference information international internet jordan journal keerthi kernel knowledge labeling lafferty lanckriet lauritzen learning link machine markov maryland mccallum method minka mitchell mixed models multiple neural nigam oxford pages pereira portals press probabilistic proceedings processes processing random rasmussen references regression relational rennie report retrieval richardson seemingly segmenting sequence seymore silva sindhwani slattery spirtes statistical statistics symbolic systems tests thesis university unrelated wide williams with world zellner http://books.nips.cc/papers/files/nips20/NIPS2007_0232.pdf 193 Direct Importance Estimation with Model Selection and Its Application to Covariate Shift Adaptation adaptation advances approach baldi berlin bias bioinformatics birbaumer borgwardt boyd brain brunak cambridge classifiers clinical communication computer conference control convex correcting covariate cross data econometrica editors error evaluating first function gretton hardle heckman hoffman huang importance improving inference information institute interfaces international journal krauledat learning likelihood machine massachusetts mcfarland models muller multiple neural neurophysiology nonparametric objectives optimization pfurtscheller planning platt predictive press proceedings processing references reinforcement research sample sampling scholkopf selection semiparametric series shelton shift shimodaira smola specification sperlich springer statistical statistics sugiyama systems technology thesis twenty under university unlabeled validation vandenberghe vaughan weighted weighting werwatz with wolpaw york zadrozny http://books.nips.cc/papers/files/nips20/NIPS2007_0579.pdf 103 Convex Relaxations of Latent Variable Training algorithm algorithms analysis approximation based berkeley bias borwein boyd cambridge chen clustering combinatorial comput computational conll constituency conversion convex corpus cristianini data dempster dependency dept discriminative editor eurospeech expectationconjugate exponential families fast from gaussian ghahramani goemans goldwater gradient graph grapheme graphical hinton icml improved incomplete incremental induction inference informational investigation jacm johnson jordan journal justifies klein kluwer laird larson learning lewis likelihood limits ling machine manning margin maximum merialdo mixture model models neal neufeld nips nocedal nonlinear numerical optimization other phoneme predictors press probabilistic problems proc proceedings programming references relaxations report research roweis royal rubin salakhutdinov satisfiability schuurmans semidefinite series shakhnarovich society southey sparse springer srebro statistical statistics structure structured syllable syntactic tagging technical text that transduction unsupervised using vandenberghe variants variational view wainwright wilkinson williamson with wright http://books.nips.cc/papers/files/nips20/NIPS2007_0375.pdf 89 Learning Horizontal Connections in a Sparse Coding Model of Natural Images abstracts acad academic ackley adaptive advances akrr alan algorithm algorithmic algorithms amir analysis analyzing applied approaches approximation april architecture area arrangement artificial assessment assignment atomic baraniuk barbados based basis battle bayesian berry between bialek biocytin boltzmann border bosking bovik cambridge canada cascades causally cell cerebral chapter chen circuits city code codes coding cognitive competitive comput computation computational computations conference connections connectivity contour convex correlated correlations cortex cosyne data dayan decomposition donoho early edition editor efficient emergence espoo explain february field fields finland fitzpatrick fourth from functional gaussian gaussians generative geometrical ghahramani good graphical greed grinvald gutmann handbook harel harmonic hierarchical hinton horizontal hoyer hurri hyvarinen identifying ieee image imagery images imaging imply information injections insights intelligence interactions international intracortical intrinsic introduction jaakkola johnson jordan july june just karklin knowledge lake layer learning learns lewicki linear linked local long machine machines malach march markov meeting methods millman mixer mixture mixtures model modeling models multi natl natural nature network neural neurally neuron neuroscience nips noise november olshausen optical organization orientation osindero ownership packer pages pairwise patterns plausible population press primate prior proc proceedings processing programming projection properties pursuit quality raina random range reasoning receptive references regularities relationship relax representation research results revealed review rozell salt saul saunders scale scene schneidman schofield schwartz science segev sejnowski selectivity self shahar shrew siam signals simoncelli simple society soft sparse states stationary statistical statistics striate strongly structural structure study symposium systems targeted taught their theory transactions transfer tree trees tropp twenty unlabeled vancouver variational video vision visual vivo wainwright wang wavelet weak willsky with zhang zhaoping zucker http://books.nips.cc/papers/files/nips20/NIPS2007_0905.pdf 233 Linear Programming Analysis of Loopy Belief Propagation for Weighted Matching aistats akyildiz algorithm arbitrary artificial athena automatic bayati belief bertsimas bipartite canadian cayirci communications compute conf constrained control edges edmonds efficient ephremides exploring factor fixed flowers freeman frey frieder gaussian generalizations gibbs graphical graphs hawaii huang ieee inference information intelligence intelligent isit jebara johnson jordan journal kaufmann kschischang learning linear loeliger loopy machine magazine malioutov march matching mathematics maximum measures millennium models morgan multihop needed networks opitimization optimality pages paths pearl policies power probabilistic proc product propagation properties queueing radio references research sankarasubramaniam scheduling sciences scientific sensor sept shah sharma solutions sparse stability statistics stretch sums survey system systems tassiulas tatikonda theory throughput topology trans transactions trees tsitsiklis uncertainty understanding walk wang weight weighted weiss willsky wireless yedidia http://books.nips.cc/papers/files/nips20/NIPS2007_0628.pdf 22 Learning Bounds for Domain Adaptation accuracy acero adaptation aistats analysis anthony approach auxiliary barlett bartlett bayesian bias bickel bilmes biographies blenders blitzer bollywood boomboxes boosting borgwardt bounds bruckner cambridge change chelba classification colt complexities computer continuous correcting crammer cvpr data david density detecting dietterich differing discriminative distributions divergence domain dredze emnlp empirical faces foundations from gaussian gehrke gretton hidden huang icml imprecisely improving instance jiang jmlr john kearns kifer language learning legetter likelihood linear localized margin markov martinez maximum mcallester mendelson methods models multiple natural network neural nips occluded partially pereira press prior probabilistic processing rademacher recognition references regression representations results risk sample scheffer schoelkopf selection sentiment simplified smola sources speaker speech statistical streams structural test theoretical theory training transfer university unlabeled using vapnik vldb weighting wiley woodland wortman yang york zhai http://books.nips.cc/papers/files/nips20/NIPS2007_0316.pdf 150 Convex Clustering with Exemplar-Based Models advances algorithml analysis annealing banerjee based between bibliographic blahut bregman buhmann capacity channel classification clustering communications comparison compression computation concave concepts cover csiszar data detection deterministic dhillon distortion divergences dueck elements experimental foundations frey functions ghosh global heckerman hofmann ieee information jordan journal kamber kaufmann learning machine meila merugu messages methods minimization mining model morgan neural optimization pardalos passing pattern points problems proceedings processing proximity puzicha rate recognition references regression related research review rose rosen science shields siam spectral statistics structure survey systems techniques theory thomas transactions trends tutorial weiss wiley with york http://books.nips.cc/papers/files/nips20/NIPS2007_1076.pdf 289 Estimating disparity with confidence from energy neurons accuracy alert algorithms also analysis appears applied barlow based been binocular blakemore both cell chen coarse comparable complementary computation confidence contrast correspondence cortex cumming cvpr deangelis decouples dense dependencies dependency depth described detect detectors different dimensions discrimination disparities disparity distributed dynamic effectively emphases encoding encountered energy erratum estimate estimation evaluation even experimental field fine fleet frame freeman functional goal have heeger here high horizontal however ideally ieee ijcv image implied indicates interpolation interpreted journal lehky light macaque magnitude magnitudes maps measure mechanism mechanisms model models motter neural neurons neurophysiology neuroscience normalization normalize normalized occlusion ofrange ohzawa parker pettigrew phase physiological poggio population position positionshift previous prince property published qian random range receptive reducing references remove representation research response responses role scharstein science sejnowski serve shift shifts should shows solely squatrito stereo stereoacuity stereograms stereoscopic stimulus strength striate structured suggests suited szeliski taxonomy that theories this trotter tuned upon using vision visual wagner whose with work http://books.nips.cc/papers/files/nips20/NIPS2007_1069.pdf 117 Ultrafast Monte Carlo for Statistical Summations accurate advances aistats alexander andrew approximation arnaud artificial body briers carlo charles combining conditional conference conjugate convergence density direction dongryeol doucet engineering estimation fast financial freitas glasserman gradients graepel gray holmes icml information intelligence international isbell james john klaas learning machine mark mean method methods michael mike million monte moore nando neural nicol nips nonparametric particle particles paul ping problems processing references rehg reuven rubinstein schraudolph shift simulation smoothing sons springer stable statistical statistics stochastic systems thore uncertainty verlag wang wiley with workshop http://books.nips.cc/papers/files/nips20/NIPS2007_0874.pdf 87 The discriminant center-surround hypothesis for bottom-up saliency adaptive analysis architecture areas asymmetries attention background baddeley based bayesian biological boats bruce buccigrossi chan characterization chiuso clustering cluttered cognit compression comput computation computational conf conspicuousness contrast correlates covert cvpr decision decomposition density detection discriminant distance domain doretto dynamic early effects evidence feature features fields figure filter fixation foreground from functional gaussian gelade generalized gilchrist gormican graph grimson harel huang hubel iccv icvr ieee image images implications improved information integratrion itti joint kalman koch kullback leibler mallat maximization mechanism mixture mixtures model modeling models motion multiresolution mumford natural networks neural neurophysiol neurophysiology niebur nips nonstriate nothdurft object objects orientation original overt pages pami perona plausibility press principle proc processing proto psych psychol psychological psychophysics rapid real receptive recognition references representation research results retrieval review robust saliency salient scalable scale scene scenes sclaroff search segmenting selection shah sheikh shifts signal similarity simoncelli soatto spat statistical statistics stauffer submitted subtraction surfer tatler texture textured textures theoretic theory time tracking trans transactions treisman tsotsos tversky using vasconcelos vetterli video vision visual walther wavelet wiesel with zhong zivkovic http://books.nips.cc/papers/files/nips20/NIPS2007_0643.pdf 158 Theoretical Analysis of Learning with Reward-Modulated Spike-Timing-Dependent P la s t ic it y access activity adjacent advance applications bailey baker cambridge cells cerebral computation conditioned conductances contralateral correlated cortex dependent destexhe distal dopamine essential fellous fetz florian fluctuating gerstner giustetto hawkins hebbian heterosynaptic huang izhikevich january kandel kistler learning legenstein like linkage maass memory models modulated modulati modulation muscles nature neocortical neural neuron neurons neurophysiol neuroscience operantly patterns pecevski plasticity precentral preparation press problem recreate references reinforcement responses reviews reward rudolph sejnowski signaling solving spike spiking stabilizing stdp synaptic theory through timing timingdependent unit university vivo http://books.nips.cc/papers/files/nips20/NIPS2007_0331.pdf 283 The Infinite Gamma-Poisson Feature Model allocation analysis applying approximate autoencoders available bayesian blei bootstrap buffet buntime cause cogcomp communications computation computer conjugate cvpr data descr description dirichlet discrete distinctive distributions energy entropy estimating feature features finding flexible free freeman frey from gaussian ghahramani griffiths helmholtz hinton http ibing image indian inference infinite international invariant jakulin jmlr johnson jojic jordan journal kemp keypoints kotz latent layers learnin learning length likelihood lowe maceachern maximum means methods minimum mixture model modeling models multiple neal neural newton nips normal pages pnas press prior process processes raftery rasmussen references royal saund scale scenes scientific series society sprites statistical statistics steyvers style sudderth topics torralba transformed uiuc univariate unsupervised using video vision visual weighted wiley wilsky with workshop zemel http://books.nips.cc/papers/files/nips20/NIPS2007_0494.pdf 53 How SVMs can estimate quantiles and the median advances algorithms annual appear approx approximate bartlett based bauer bayes berlin bernoulli cambridge christmann classes clipped colt compare computation conference consistency constr different differential edmunds entropy estimation first function functions gruyter hush hwang icnc inequality information integration international kernel koenker learn learning loss mach machine measure minimizers natural neural nonparametric numbers operators oracle pages press proceedings processing quantile references regression regularized risk robustness scholkopf scovel sears shim simple smola spaces springer steinwart support systems takeuchi that theory triebel university vector williamson http://books.nips.cc/papers/files/nips20/NIPS2007_0329.pdf 4 Random Sampling of States in Dynamic Programming aaai academic actions adprl advances algorithm algorithms alspector american anytime approach approximate april artificial atkeson automation balance based blondel bounds break cambridge carlo communications complex complexity computation computational computing conference continuous control convergence cowan criterion curse decision differential dimensionality discretization dyer dynamic econometrica edition editors efficient elsevier from functions gerald global gordon hauskrecht heuristic humanoids ieee ijcai incremental information intelligence international interscience island iteration jack jacobson jair joint joshua journal july kaufmann lavalle learning leen lewis local louisiana machine markov markovian mayne mcreynolds methods monte moore morgan morimoto muller multiple munos national neural nikos nonparametric observable optimal optimization optimizers options orleans pages partially pineau planning point policies pomdp pomdps press pricing problems proceedings processes processing programming providence publishers randomization randomly references regression reinforcement representation resolution results rhode robot robotics rust sampling search simmons smith solla spaan space speed speeding stephens strategies style survey symposium syrmos systems szepesvari tesauro theory thrun trajectory tsitsiklis uncertainty university using value variable volume wiley york zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0228.pdf 182 Anytime Induction of Cost-sensitive Trees aaai acquisition active algorithm anytime approach artificial background bayer better bias blake blumer boddy bradford breiman brodley brooks brunk buchanan class classification classifier classifiers comparisons computer concept constrained cost costs data databases dean decision deliberation demsar diagnostic dietterich domingos ecml ehrenfeucht elements elkan empirical environments esmeir evaluation examples feature foundations friedman from general generating genetic greiner grove hastie haussler hybrid icdm icml ijcai induction inductive inference information integrating intelligence international into iterative journal kaufmann knowledge kohavi kunz langford learning lecture letters ling machine making margineantu markovitch melville merz metacost method mining misclassification monterey mooney morgan multi multiple norton notes nunez occam olshen over policies policy pragmatics prediction problem proceedings processing programs provost pruning quinlan razor recognition references regression repository research roth saar scales scheduling schlimmer science search selection sensitive sensor sets sheng solving springer statistical stone strategies test tibshirani time tree trees tsechansky turney types verlag volume wadsworth warmuth with workshop york zadrozny zhang zubek http://books.nips.cc/papers/files/nips20/NIPS2007_0082.pdf 51 Cooled and Relaxed Survey Propagation for MRFs aaai academic algorithm algorithms analysis approximations arbitrary arxiv asynchronous available battaglia belief bell below braunstein cipra classify clustering complete computation conditions constructing convergence convergent cuts ding disambiguation efficient elidan energy engines expectation factor finley fixed free freeman frey functions generalizations generalized glass graph graphs heskes heuristic html http icml ieee information informed intelligence into ising joachims kappen kernighan kluwer kolar koller kolmogorov kschischang learning loeliger look loopy machine machines maneva mcgraw message methods mezard minimization minimized minimizing minka model mooij morphing mossel neural news nips norwell online optimality park partitioning passing pattern person physical points procedure product propagation publishers random references region report residual review reweighted satisfiability scheduling semeval siam solutions solve spectral struct structured sufficient supervised support survey systems task taskdescription technical text theory thresholds transactions tree tutorial uned uniqueness using vector wainwright weighted weiss welling weps what with yedidia zabih zecchina http://books.nips.cc/papers/files/nips20/NIPS2007_0673.pdf 281 Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs adaptive advances algorithm allocation analysis applied asymptotically auer bandit based berkeley bianchi bounds brafman burnetas california cambridge cesa combining computer conference confidence decision department discrete dynamic efficient electrical engineering estimation exploitation exploration finite fischer general information international interval john journal katehakis large learning littman logarithmic machine markov mathematics mdps model multiarmed near neural offs online operations optimal ortner policies polynomial press problem proceedings processes processing programming proves puterman references regret reinforcement research result robbins rules sciences second sons stochastic strehl systems tennenholtz tewari theoretical thesis this time trade twenty undiscounted university unknown using wiley with york http://books.nips.cc/papers/files/nips20/NIPS2007_0186.pdf 2 A Spectral Regularization Framework for Multi-Task Structure Learning abernethy academic advances algorithms analysis ando applications argyriou artificial attributes bach bakker bartlett baxter bayes bayesian bhatia bias boosting bounds cambridge cancer chari clustering component computer conf conference conjoint constructing convex cristianini data desarbo designs detection ecole efficient evgeniou experimental factorization feature features framework freeman from function gating genomes genomic genomics ghahramani ghaoui graduate green heskes heterogeneity hierarchical hiriart horn independent inductive inequalities information informative integrative intelligence international jaakkola johnson jordan journal kernel koller lanckriet latent learning lemarechal lenk linear lockwood machine majorization margin marketing marshall mathematics matrix maurer maximum micchelli microarray mines minimization model multi multiclass multiple murphy neural object olkin pages paris partworth pattern pontil predictive press priors proc procedures proceedings processing programming raina rank recognition recovery reduced references regularization related rennie report research science semidefinite sharing sigma springer srebro structures system systems task tasks technical texts theory torralba transfer university unlabeled urruty using vert vision with yang young zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0587.pdf 114 Modeling homophily and stochastic equivalence in symmetric relational data adrian airoldi aldous alvarez amer amsterdam analysis applications approaches assoc beattie berlin bilinear blei blockstructures butland cambridge canadien charles classes coli column complexes conserved containing data davey david discovering discovery dyadic ecole edoardo effects emili eric escherichia essential estimation exchangeability faust fienberg flour generalized greenblatt griffiths handcock hoff holland hoover http institute interaction international isbn issn joshua katherine kemp krogan krzysztof latent lecture link linkkdd mark massachusetts math membership memo methods mixed model models nature network north notes nowicki pages parkinson peregrin peter prediction press probabilites probability proceedings protein raftery references related relational richards rome saint snijders social space springer stanley starostine statist statistics stephen stochastic technology tenenbaum thomas topics university volume wasserman workshop xiii xing yang york http://books.nips.cc/papers/files/nips20/NIPS2007_0893.pdf 20 Supervised topic models aaai allocation analysis annotated applying author authors bayesian bickel blei buntine categories categorization class classification clustering computer conditional data david dennis dirichlet discrete discriminative docksum documents druck editors elements exploiting friedman generative griffiths hall hastie hierarchical ieee integrating jakulin jmlr jordan kintsch landauer latent learning mathematical mcauliffe mccallum mcnamara meaning model modeling models multi natural nips pages pang pattern perona prentice preparation press probabilistic proceedings rating recognition references relationships respect road rosen scales scene seeing semantic sentiment sigir smith springer stars statistical statistics steyvers supervised syntax tenenbaum tibshirani topic topics training vision wang with http://books.nips.cc/papers/files/nips20/NIPS2007_0263.pdf 192 An Analysis of Convex Relaxations for MAP Estimation adams agarwala agreement aistats algorithms analiz analysis applications approximate approximation available barahona based berkeley binary boyd boykov brookes california cambridge chekuri classification cohen combinatorics comparative complementation complexity conditions cone constraint convex cuts cvpr dalhaus dimensional duality dvumernykh eccv energy eriksson estimation european exactness exponential extension facets families fast field fields formulation global goemans graph graphical hammer hansen hoesel http icml ieee improved inference information institute iwcia jaakola japan johnson jordan journal kahl karzanov khanna kibernetika kleinberg kluwer kojima kolen kolmogorov koster kumar labeling labelling lafferty large lasserre letters lifting linear mahjoub markov matching mathematical maximum message methods metric metrics minimization minimum modeling models moments multiterminal muramatsu naor noisy nonconvex olsson operations optimization order oxford pages pairwise pami papadimitriou partial passing pawanmudigonda persistency polynomials polytope pomekh press problem problems processes programming quadratic random ravikumar references relationships relaxation relaxations report research roof rother satisfaction satisfiability scale scharstein schellewald schlesinger schnorr second semidefinite seymour sherali siam sicomp signals simeone singnalov sintaksicheskiy soda solving spectral staff stoc stochastic study subgraph suzuki syntactic szeliski tappen tardos technical technology theorems theory tokyo torr trans trees treewidth university using usloviyakh vandenberghe variational veksler visual volume wainwright williamson willsky with yannakakis zabih zisserman zosin zritelnikh http://books.nips.cc/papers/files/nips20/NIPS2007_0837.pdf 188 The Infinite Markov Model abraham according addition adjusting advances alberto also although amnesia amnesic annals apostolico apparent application approach architecture assigned automata basic bayesian bejerano bell between beyond binary biology breaking breakings buhlmann chains chinese classify clustering communication completely computational computing context continuous corpora dana daniel data deeper descending described dirichlet distributed distribution distributions dynamic each estimating expect extended extending fernando frederick from gaussians generative generators gill girolami goldwater goodman grams griffiths hierarchical hierarchically hierarchy http ieee independent inference information intermediate interpolated interpolating interpretation jacm jelinek johnson joshua journal just kaban kneser language large latent leaf learn length level like linear looks make mark markov mathematical mauldin method methods microsoft minka mixtures model modeling modelling naftali needed neural nips nodes only optimal order orders organized originates over pages paper papers partitions pereira peter polya posterior power presented press probabilistic proc process processes processing profiles progress properties proteins random recognition recursive references report research resides restaurant robert root school search self series shannon sharon shtarkov similar simplicial singer sleator space speech statistical statistics stick stochastically sudderth suffix system systems tarjan technical that their theory third this thomas time tishby tjalkens tokens trans tree trees types used user variable variables version vertically very volume weighting when which while whye willems william williams word workshop wyner yoram http://books.nips.cc/papers/files/nips20/NIPS2007_0726.pdf 28 The Tradeoffs of Large Scale Learning accuracy advanced advances aggregation alexander alexandre algorithms american analysis annales annals applications applied association auer august bartlett based behavior berlin bernhard bertinoro bottou boucheron bounds bousquet cambridge classification classifiers cliffs clint colt complexity computation computer concentration conference consistency convex convexity data david dennis dependences dimension duda ecole editor editors empirical englewood equations esaim esther estimation faculte fast fields gabor guaranteed hall hart hush ieee importance inequalities information ingo italy jersey joachims john jordan journal judd june kelly large lawrence learnable learning lecture lectures lecun leon leslie levin line linear loading loss lugosi machine machines march massart mcauliffe measuring meir mendelson methods michael minimization murata networks neural noboru nonlinear notes numerical olivier online optimal optimization pages pascal patrick pattern peter philadelphia polytechnique prentice press probability proc proceedings processes processing rates recent references related research richard risk robert saad saul scale scene schnabel scholkopf science sciences scovel sebastian series shahar shallow smola some springer squared statistical statistics statististics steinwart stephane stephen stoc study support survey svms systems theory thesis thorsten thrun time tong toulouse training transactions tsybakov unconstrained university valiant vapnik vector verlag vladimir volume wiley williamson with yann zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0754.pdf 38 Evaluating Search Engines by Modeling the Relationship Between Relevance and Clicks aaai accurately additive agichtein allan aslam based behavior brill broder cahan carterette clarke classified click clicks clickthrough collecting collections construction cormack cumulated data dominowska dumais dupret dynamic effectiveness efficient efficiently engines estimating evaluating evaluation experiments feedback forum from gain generalized generation granka hastie hembrooke hurtado icml implicit improving incomplete incorporating information interaction interpreting invasive jarvelin joachims journal judgments kekalainen large learning live lncs logs measures measuring mendoza methodological methodology minimal minimally mining model models nicholas nonparametric optimizing pages palmer partially pavlu performance piwowarski plate predicting preferences proceedings query radlinski ragno randomization ranking rate regression relevance reliable result results retrieval richardson royal sampling scale science search series sigir sitaraman soboroff society spire splines springer statistical statistics syst systems taxonomy technique techniques test text thin through tibshirani training trans unbiased user using vector wasserman wild with without wood workshop yilmaz zobel http://books.nips.cc/papers/files/nips20/NIPS2007_0949.pdf 267 A Game-Theoretic Approach to Apprenticeship Learning abbeel apprenticeship approach available boosting colt exploration freund game http icml inverse kearns learning line long machine near nips optimal pabbeel polynomial prediction princeton references reinforcement schapire singh stanford supplement syed theoretic theory time usyed version http://books.nips.cc/papers/files/nips20/NIPS2007_0690.pdf 90 Iterative Non-linear Dimensionality Reduction by Manifold Sculpting academy advances alexander algorithms analysis belkin bengio bernhard bickel brand cambridge charting clustering component data decomposition dimension dimensional dimensionality domain donoho editors eigenmaps elizaveta embedding estimation fast framework geometric global globally grimes hessian high hongyuan information intrinsic john jordan joshua journal kearns kernel klaus langford laplacian lawrence learn learning levina likelihood linear local locally machine manifold manifolds martin matthew maximum method methods michael mikhail monperrus muller national neural nips niyogi nonlinear pages partha parzen pascal peter platt press principal proc processing reduction references research robert roweis sara saul scholkopf science sciences silva smola solla spca spectral support systems tangent techniques tenenbaum think unsupervised vector versus vincent volume weiss windows yoshua zhang zhenyue http://books.nips.cc/papers/files/nips20/NIPS2007_0234.pdf 174 Receptive Fields without Spike-Triggering acad advances akaho algorithms analysis analyzing annals arrangement artificial average bach baylor between bialek biometrika bischof bottleneck brain brisk broaden cambridge canonical cell cells characterization chechik chichilnisky codes coding component comput conference consistency convergence correlated correlation covariance cross curr data decoding detectors devries diamantaras dimensionality dimensions edge editors eichhorn extraction feature fields filtering firing from fukumizu ganglion gaussian generalization generalized globerson gretton hofmann hotelling icann ieee independent information informative international jordan journal kang kernel kung kuss learning local logothetis machine mammalian masland matter maximally meeting meister melzer method methods metrics model models mosaic multineuronal natl natural network networks neural neurobiol neuron neuronal neurophysiology neurosci noise nonlin nonlinear opin osaka pages paninski parallel patterns phys pillow population prediction press probabilistic proc processing properties psychometric rabbit rasmussen reading receptive reduction references reiter relations research responses retina retinal rust saul schnitzer scholkopf schwartz sejnowski sets seung shamir sharpee sharpen signal signals simoncelli simple smola society soft sompolinsky spatial spike spiking stat statistical statistics sustained systems techniques theoretic three thrun tishby tolias train transactions triggered tuning using uzzell variables variates victor wassle weiss weston with xiao yoon zeck zhang zien http://books.nips.cc/papers/files/nips20/NIPS2007_0599.pdf 97 Competition adds complexity aaai akademie allender alternative artificial bell berlin bernstein boas bounded christopher complexity conference control daniel decentralized decision dynamic editor emde eric finite forschung frege games gerd givan goldsmith hansen horizon immerman intelligence journal judy lusena markov martin math mathematics mathematische mundhenk national neil nineteenth observable oper operations pages papadimitriou partially pattern problems proceedings process processes programming proving recognition references research results robert satisfiability savelsbergh shlomo stochastic systems technical theorems tiling tsitsiklis verlag volume wang wechsung zilberstein http://books.nips.cc/papers/files/nips20/NIPS2007_0454.pdf 184 A neural network implementing optimal state estimation based on dynamic spike train decoding acad academic adaptive analysis applications bayesain bayesian beck belief biomed brain bremaud brockett brown cell chapter circuits comput computation control cortex cortical counting danso data davis detection differential diffusion donoghue doubly doya dynamic dynamical dynamics eden edition editors encoding equations estimation exact fellows filtering frank from gebiete grimmett hatsopoulos hidden ieee implementation inferences information interface ishii jazwinsky kailath kushner machine markov martingale model models motor natl netw neural nonlinear norman observations optimal orientation oxford paninski place point poisson pouget press primary probability proc process processes propagation queues random recurrent references segall shoham siam snyder solo some sompolinsky springer statistical stirzaker stochastic theory third trajectory tran trans transactions tuning twum university verw visual wahrscheinlichkeitheorie with wonham yishai york zakai http://books.nips.cc/papers/files/nips20/NIPS2007_0681.pdf 291 Modeling Natural Sounds with Modulation Cascade Processes academic acoust amplitude analysis anonymous assp attias auditory authors bayesian bregman coding complex comput conference curr data demodulation efficient environment estimation fourier from griffin hearing hierarchical ieee images info introduction japan karklin learning lewicki media minka model modified moore natural nature neural neurobi nonlinear nonstationary opin order patterson picard press probabilistic proceedings processing psychology references regularities report represented sampled scene schreiner short signal signals simoncelli smith sounds spectrum springer statistical statistics system technical temporal time trans transform unevenly vision vismod visual http://books.nips.cc/papers/files/nips20/NIPS2007_0259.pdf 120 What Makes Some POMDP Problems Easy to Approximate? accelerating acting algorithm algorithms analysis anytime approximate approximations april artificial assisting automation based bertoldi bound brown cassandra circulant complexity computer computing condon conf control convergence decision dementia dept domains during finite from function functions goldsmith gordon gray handwashing hanks hauskrecht hoey horizon ieee implementation improved infinite intelligence iteration journal kaelbling kearns large learning littman loss lusena machine madani making mansour markov mathematics matrices mihailidis mundhenk national near nonapproximability observable operations optimal over pages papadimitriou partially persons pineau planning point pomdp pomdps poupart probabilistic problems proc process processes publishers reachable references report research results review robot robotics rong sampling school science sequential simmons singapore singh smallwood smith sondik spaan space sparse speeding stochastic successive systems technical thesis through thrun toeplitz tsisiklis uncertainty undecidability university upper using value vision vlassis with zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0630.pdf 210 Discriminative Log-Linear Grammars with Latent Variables accurate algorithm andrew annotation annotations appear barrett bayes best bracketed brown charniak classifiers coarse collins compact comparison computation computational computer conditional context contrastive corpora data dirichlet discriminative driven eisner emnlp equally estimation expressive fields fine free from generative ghahramani grammars head henderson hidden hierarchical hinton icml improved inference infinite inside interpretable johnson joint jordan klein koller labeling lafferty language lari latent learning level liang linear lingusitics logistic machine manning margin mathematics matsuzaki maxent mccallum mcclosky melamed mercer merge mixture miyao models multi naacl naive nakano natural network neural nips nocedal numerical optimization outside parser parsing partially pcfg penn pereira petrov pietra probabilistic processes random reestimation references regression regularized reranking scalable schabes segmenting sequence smith speech split springer statistical stochastic structure tagging taskar thesis thibaux training translation tree tsujii turian ueda unlabeled unlexicalized using variable weighted wellington with wright young http://books.nips.cc/papers/files/nips20/NIPS2007_0050.pdf 170 Support Vector Machine Classification with Indefinite Kernels akutsu algorithm alignment alternative analysis analytic artificial assessment asuncion athena bach bartlett based bennet bertsekas bioinformatics boyd bredensteiner california cambridge canu center chang citeseer classification classifiers computer conference conic constructing convex cristianini cunningham cutting cuturi data database definite detection distances duality edition eigenvalues feature finite focused functions genomic geometry ghaoui gigola goffin gomez haasdonk handwritten hilario histograms homology html http hull hyperkernels ieee image indefinite information integration intelligence international interpretation irvine joint jordan journal kalousis kernel kernels lanckriet large learning machine machines marco mary matrix method methods mining mlearn mlrepository multiple newman noble nondifferentiable nonlinear numerical objects optimization overton pages pattern permanents plane polytopes positive press problem proceedings programming protein ratsch recognition references regularization report repository research saigo scale schafer scholkopf school sciences scientific semidefinite siam sigmoid similarity sity smola software solving sonnenberg space strategies string study survey svms technical text training transactions transformation transport twentieth type ueda univerand university using vandenberghe vert vial williamson with woznica zamolotskikh zhang http://books.nips.cc/papers/files/nips20/NIPS2007_1007.slide.pdf 231 Probabilistic Matrix Factorization (PMF) achieve adaptive adding approaches automatic better boltzmann capacity collaborative combining constraining control dataset datasets dealing difficulty entered error extension extensions filtering handling have imbalanced improves information large learn linearly machine make many model models movies multiple nearly netflix number observations parameters performance performs predictions preferences present priors propose provide rate rated ratings restricted scales score sets significantly similar sparse system than that this unrated users using very well which with http://books.nips.cc/papers/files/nips20/NIPS2007_1077.pdf 264 AC C E P T E D T O A P P E A R AT N E U R A L I N F O R M AT I O N P RO C E S S I N G S Y S T E M S 2 0 0 7 across advanced algorithm algorithms allerton analysis applications approximate approximations associative auai based belief binary bounds calculus capacity chatalbashev check chernyak chertkov class codes comp comparing comparison completeness conditions conf constructing convergence correlation crystal cuts decoding decodings density dimensional dimensionality discrete disorder editors effects energy errors estimation exact expansion factor field fisher fixed framework free freeman frey function functions generalized ghahramani gibbs gomez graph graphical graphs greig helps heskes iccv icml identical ieee ihler images improve inequalities inference intelligent intractability introduction ising istrail jaakkola jmlr jojic jordan july june kappen kaufman kaufmann koller kolmogorov kschischang lattices learning linear loeliger loop loopy machine markov mateo math maximum mean measures mech mechanics message messagepassing method methods minimized model models mooij morgan mrfs networks neural onsager opper order pages pami parameters parity partition pearl physical planar points porteous posteriori press probabilistic product programming propagation reasoning references related reparameterization review richardson saad saul seheult sept series shlosman stat statistical statistics stereo sufficient symp systems tappen taskar tatikonda their theory three trans transition tree truncating under uniqueness universality upper urbanke using variational volume wainwright weiss what willsky with yedidia zabih http://books.nips.cc/papers/files/nips20/NIPS2007_0682.pdf 212 Regret Minimization in Games with Incomplete Information aaai abstraction algorithm algorithms appear approximating artificial association automated based behavior billings bowling burch cambridge commerce competition competitive complexity computation computer conference convex course davidson economic eighteenth electronic equilibria equilibrium extensive finding form full game games generating gilpin gordon gradient hoda hold holte imperfect information intelligence international item joint journal koller large littman massachusetts massive megiddo nash national neural news online optimal osborne pages pena person player poker press proceedings processing programs real references regret rubenstein sandholm scale schaeffer schauenberg sequential seventh strategies strong systems szafron texas theoretic theory time twenty zero zinkevich http://books.nips.cc/papers/files/nips20/NIPS2007_0416.pdf 33 Simplified Rules and Theoretical Analysis for Information Bottleneck Optimization and PCA with Spiking Neurons academic advances aharonov aihara algorithms allerton annual asymmetric berry besson bialek bottleneck buesing burkitt byrne cambridge cereb communication competitive component components computation computing conditions conference connections control cooper correlated correlations cortex cortical dependent distal distribution dopamine edition editors equation eugene extract extraction fokker formulation function gerstner grayden gutig hebb hebbian implementations independent information input intrator izhikevich jean journal kazuyuki kistler klampfl learn learning legenstein linear linkage maass meffin memory method model models networks neural neuron neurons neurosci nips objective optimality optimization page pages pascal pereira pfister physical planck plas plasticity preparation press problem problems proc proceedings processing references review reward risken rotter rule sejnowski signaling solve solving sompolinsky spike spiking springer stability stable statistical stdp structure subgroups synaptic systems taro temporally tesauro theory through ticity timing tishby toyoizumi university unsupervised using version visual volume weight with wulfram http://books.nips.cc/papers/files/nips20/NIPS2007_0812.pdf 45 Augmented Functional Time Series Representation and Forecasting with Gaussian Processes accuracy active advances agriculture ahead allocation analysis application approximate asset available based bayesian becker bengio bishop business candela chapados cliffs combination committee comparing computation cost curve data department derivatives design diebold discussion economic edition editors englewood fitting forecasting functional functions futures gaussian girard grinold hagan hall hamilton hasselmo hill http hull ieee information inputs journal july kahn learning machine management mariano mcgraw model mozer multiple murray networks neural obermayer optimal options other oxford pages pattern portfolio prediction predictive prentice press princeton priors process processes processing publication quionero ramsay rasmussen recognition references regression research royal second series service sets silverman sixth smith society sparse springer statistical statistics step systems time touretzky transactions tresp uncertain unifying university usda using view williams with http://books.nips.cc/papers/files/nips20/NIPS2007_0907.pdf 208 Congruence between model and human attention reveals unique signatures of critical visual events allocation analysis applications approach april attention attentional baldi ballard based behavior beyond bottom capture carmi castelhano causes cognitive components computational computer conditions conference contextual control correlates cortically coupled cvpr december dependent detecting differences direction dynamic einhauser engineering environments events experimental features gaze gerson global guidance hahn hayhoe henderson hoffmann human ieee image images incorporating influence influences intelligence interactive into irwin itti iyer january journal june koch konig kramer kruse machine mechanisms minneapolis model modeling monkey movements natural navalpakkam neural niebur november object october oculomotor oliva overt pages parkhurst parra pattern perception performance peters principled proc psychological psychology rapid real recognition references rehabilitation research review role sajda salience saliency scene scenes sciences search selection siego spatial surprising systems task theeuwes torralba tracking transactions trends under versus video vision visual world zelinsky http://books.nips.cc/papers/files/nips20/NIPS2007_0894.pdf 164 Unconstrained On-line Handwriting Recognition with Recurrent Neural Networks absolute acquired algorithms alternately analysis anonymous appear applications applied approach architectures atwell based bengio best bidirectional black both bottou brazil bridle brown bunke cambridge centre classification coloured comprehensive computation computing conceptual conf conference connected connectionist convolutional corpus corresponding created curitiba cvpr dashed data database dave dependencies dept derivative difficulty document dynamical each ease editors emitted engineering english feedforward fernandez field figure flow fogleman framewise frasconi from garside generic gomez gradient graves guide handwriting handwritten herault highest hochreiter huang humanities icml ieee image independent indicated individual inputs intelligence international interpretation invariance jacobian jaeger jianying johansson john journal kolen kremer label labelling learning lecun leech left leon lighting line lines liwicki long lstm machine manke manual memory methods michael model nets network networks neural neurocomputing norwegian novel november npen object ondb online only ordinates other output outputs pages paliwal passing patrice pattern phoneme pittsburgh plamondon platt plotted plotting point pose practices preprocessed press probabilistic proc proceedings processing recognition recognizer reconstructed recorded recurrent references reichert rejean relationships report representations right russell sargur schmidhuber schuster sensor sentence sequence sequential short signal simard simple soulie speech springerverlag srihari statistical steinkraus strokes survey systems tagged technical temporal term text thornton timestep token transactions university unsegmented user using value vertical visual visualisation volume waibel when whiteboard with writer yann young http://books.nips.cc/papers/files/nips20/NIPS2007_0347.pdf 166 Boosting the Area Under the ROC Curve accuracy against algorithm algorithms analysis annual application area associates based boosting bradley cambridge case characteristic collected colt combining comparing computational computer conference considerations cortes curve decision detection diagnostics efficient eighteenth erlbaum error estimation evaluation fawcett freund generalization graphs hanley icml induction introduction iyer journal kalai kearns kohavi lawrence learning line long machine margin martingale mcneil meaning meets middle minimzation mohri nips noise notes operating optimization pages papers pattern practical preferences preliminary presence press proc proceedings provost psychology radiology ranking rate receiver recognition report research researchers rudin schapire sciences servedio signal singer stoc swets system technical theoretic theory under vazirani version http://books.nips.cc/papers/files/nips20/NIPS2007_0575.pdf 309 Multiple-Instance Pruning For Learning Efficient Cascade Detectors adaboost additive algorithms automatic baluja based blake boosted boosting bourdev brandt brubaker cascade cascaded chain classifiers confidence constrained convolutional cvpr dept design detection detectors direct eccv event example face fast feature features friedman gesture hand hastie huang iccv ieee improved instance invariant jones kanade learning logistic machine matas mullin multi multiple network neural nips nowlan object optimal optimization pami platt poggio predictions proc rapid rare rated real recognition references regression rehg report robust rotation rowley schapire selection sequential shum simple singer sochman soft stanford statistical statistics sung technical tibshirani time towards tracker training trans university using view viola volume waldboost xiao zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0763.pdf 275 --PREPRINT-- accelerated advances algorithm algorithms allocation american analysis annals annual antoniak applications applying approach approximate artificial aspect association bayesian beal blei buntine cognitive collapsed college computational conference constructive cowell data dawid definition directed dirichlet discrete expectation expert gatsby generative ghahramani graphical griffiths hidden hierarchical inference information intelligence jakulin jordan journal kurihara lafferty latent lauritzen learning london machine minka mixture mixtures model models networks neural neuroscience newman nonparametric priors probabilistic problems proceedings process processes processing propagation references representation research science semantic sethuraman sinica society spiegelhalter springer statistica statistical statistics steyvers systems thesis uncertainty unit university variables variational verlag vlassis volume welling with http://books.nips.cc/papers/files/nips20/NIPS2007_0110.pdf 312 People Tracking with the Laplacian Eigenmaps Latent Variable Model ability accad acceleration accuracy acknowledgments advantages aistats algorithms ambient ambiguities ambiguous analysis analyzers approach automatically award based bayesian belkin binary bishop black brand camera career carreira caused cham chapman combination combines comparisons compatible complex component computation computationally constraints continuous coordinated created cvpr data demonstrate density different differentiable dimension dimensionality distributions dynamic dynamical eccv efficient eigenmaps embedded estimation exceed exploration explore factor figure filters fleet freeman from funding future gaussian generative globally good gplvm hall have hertzmann high highly hinton howe http human hypothesis icassp iccv icml image implicit inference january jepson journal june laplacian latent lawrence learn learning lelvm leventon linear linearly local machine macp manifold manifolds manually mapping mappings mcext mean measurements merwe method missing mixture mocap model modeling models monocular more motion motions multimodal multiple neural nips niyogi noisy nonlinear november objective observation obtained operation optima over pages paper partially particle people perpinan point posterior practical presence principal prior priors probabilistic probability process proposed provides puppetry real reconstruction reduction references rehg representation research results robust robustness roweis running same scaling sclaroff segmentation sequences sequential sets setting several shadow shift show sidenbladh sigal sigma silhouettes silverman simple single small sminchisescu space spaces sparse spectral standard state statistics strategies such sufficient superior supported svensen synthesis synthetic taylor terms that this tian time topographic tracker trackers tracking tracks training type types unfold urtasun using variable variables video visual volume walking wang whose will williams with work yang http://books.nips.cc/papers/files/nips20/NIPS2007_0496.pdf 307 Bayesian Co-Training analyzing applicability balcan bickel blum bounds brefeld bridging carin classification clustering colt combining dasgupta data ecml effectiveness estimation expansion fields figueiredo from gaussian generalization ghahramani ghani hartemink icml information john knowledge krishnapuram labeled lafferty learning littman machine management mcallester mitchell mixture models multiple nigam nips practice press processes rasmussen references report scheffer semi spectral steffen supervised support technical theory tobias towards training unlabeled using vector views virginia williams with workshop xiaojin yang zoubin http://books.nips.cc/papers/files/nips20/NIPS2007_0391.pdf 161 Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing algorithm artificial belief belongie body borenstein bottom categorization chen chui class classes cloth combine combined composite compositional constituent context contexts coughlan cour cvpr dechter deformable detection down eccv fergus ferreira figure finding fowlkes geman grammar graphical ground guided hierarchical hierarchy human iccv image implicit induction integration intelligence invariant jojic jordan journal klein kumar labeling language learning leibe leonardis levin locus loopy machine malik manning matching mateescu meila mixture mixtures model modeling models natural nips object objects pami parsing perona piecing point probabilistic propagation puzicha puzzle rangarajan rapid recognition recognizing references research rigid robert scale schiele search segmentation shape shapes sketching spaces specific srinivasan system templates together torr trees ullman unsupervised using weiss winn with yuille zisserman http://books.nips.cc/papers/files/nips20/NIPS2007_0756.pdf 72 Catching Up Faster in Bayesian Model Selection and Model Averaging advances akaike algorithms approach assoc asymptotic automat barron bayes bayesian best between biometrica cambridge characterization choice coding complexity compression conference contr criterion cross data dawid density derandomizing description dimension discrete efficiency equivalence estimating estimation expert factors generalized grunwald herbster identification ieee index inform information inquiry jaakkola kass learning length logically look machine math mean minimum model modeling monteleoni neural nonparametric online optimality pages parametric part performance prediction prequential press principle priors problems proceedings processing raftery references regression rissanen schwarz scientific selection sequences shared shibata sinica smooth snowbird source speed stanford stat stationary statistica statistical statistics stochastic stone strategies strengths switching systems theoretic theory thesis tracking universal university utah validation variables volf volume vovk warmuth willems world yang http://books.nips.cc/papers/files/nips20/NIPS2007_0805.pdf 40 Subspace-Based Face Recognition in Analog VLSI accurate acoustics adaptive algorithms analysis andy annual anti applications approach asic azarnasab based batur belhumeur bridges carva class combined component computer conf conference cost david december design eigenfaces esteban face ferdinando figueroa fisherfaces flinchbaugh florida fpga germany gonzalo harter hayes hebbian hespanha highly hosseini human icassp identification ieee image implementation intel international jection joao kamakoti karlsruhe kriegman learning ligence linear machine matamala methods miguel mixed model network neural pages parameterisation pattern pentland peter prasanna principal proc proceedings processing recognition references sadri samaria sarasota seth shams signal society specific speech stochastic subspace sudha symposium system transactions turk using vision vlsi volume wavelets with withs workshop http://books.nips.cc/papers/files/nips20/NIPS2007_0918.pdf 101 Expectation Maximization and Posterior Constraints agreement alexander algorithm alignment andrew annals annealing athena banchs based belmont bertsekas bias bottleneck brown cambridge chapelle christoph coling comparison complexity comput computational computer computing corpus csiszar daniel data della dempster dictionaries distributions divergence editor editors eisner estimation europarl evaluation expectation franz fraser friedman from geometry ghahramani gideon gispert goldsmith grammar graphical guidelines hajic hermann hinton icml improved incomplete incremental induction information introduction jaakkola jason jordan josef journal justifies klein kluwer koehn labeled laird lambert language lawrence learning liang likelihood linguist linguistics machine mann manual marcu marino martin mathematic maximum mccallum measuring mercer methodological methods michael minimization models mohanty mosenzon multilingual multivariate naacl naftali neal nips noah noam nonlinear number other pages parameter partially percy permanent peter philipp pietra press probability problems proc programming quality references regularization resources robert robust royal rubin saul scalable scholkopf science scientific semi series simple slonim smith society sparse statistical stephan stephen structural supervised systematic szummer taskar that theoretical tillmann tishby tommi translation valiant variants variational various view vincent vogel volume weighted with word zien zoubin http://books.nips.cc/papers/files/nips20/NIPS2007_0699.pdf 108 Adaptive Online Gradient Descent adam advances agarwal algorithms amit ascent bianchi bounds bregman cambridge cesa colt convex divergences duality editors elad fenchel gabor games generalized gentile gradient hazan hebrew hoffman icml infinitesimal information kalai kale learning line logarithmic loss lugosi martin neural nicolo online optimization pages platt prediction press processing programming proving references regret relative repeated report satyen scholkopf shai shalev shwartz singer strongly systems technical tutorial university using warmuth yoram zinkevich http://books.nips.cc/papers/files/nips20/NIPS2007_0284.pdf 93 Bayesian Inference for Spiking Neuron Models with a Sparsity Prior activity algorithms analyzing approximate artificial assemblies bayesian berkeley bialek biological blowfly brisk brown buzsaki california cascade cell cells characterization chichilnisky chornoboy classification coding complex computation connectivity cortical csicsvari cybernetics decoding design detectors dragoi edge electrical elements encoding engineering ensemble estimation expectation exponential families features field fields filtering from functional ganglion gaussian gazzaniga harris hippocampus hirase identification inference information intelligence isolation journal karr lasso learning likelihood linear local london macaque machine masland maximum mean methodological miller minka model models movement movshon nature network neural neuron neurosci neuroscience okatan opper optimal organization paninski people performance pillow point prediction press probabilistic proceedings process processes propagation properties random rasmussen real receptive references regression relevant responses retinal royal rust schramm schwartz sciences seeger selection sensitive sequences series short shrinkage simoncelli snyder society space sparse spatial spatiotemporal spike spiking springer statistical statistics steinke steveninck stimuli stochastic sustained system systems tech texts tibshirani time touryan transfer tsuda tuebingen uncertainty university using uzzell visual williams wilson winther with xiao zeck http://books.nips.cc/papers/files/nips20/NIPS2007_0863.pdf 176 Fast and Scalable Training of Semi-Supervised CRFs with Application to Activity Recognition aaai additive advances algorithms analysis andrew annals appendix approximate approximations artificial ashenfelter association belief bengio besag best boosted boosting bulatov carlo choudhury classification committee comparing computation computational computing conditional conference constrained constructing contextual data dependency dependent derivative derived detection dietterich discriminative documents efficient efficiently empty energy ensemble entropy environment equations evidence experiments features field fields first free freeman friedman from function functions gaussian generalized geyer ghahramani gradient grandvalet greiner harmonic hastie hemp human icml ieee ijcai improved inducing inference information intelligence international iteration iteratively jerome jiao joint journal kautz labeled labeling lafferty language lattice learner learners learning liao likelihood linguistics logistic logitboost longer machine mann matlab maximized maximum mccallum mccullum mean method minimization mitchell model modeling models monte mrfs murphy national neural newton next nigam nips object pereira probabilistic problem proc processing propagation random references regression respect respectively result robert royal schuurmans second section segmentation segmenting semi semisupervised sequence show society solving spatial start statistical statistician statistics supervised syntactic systems technologies text theory they this thompson thrun tibshirani took topic torralba training transactions tree trevor uncertainty unlabeled update using view virtual wang weak weiss were where with wlse yedidia http://books.nips.cc/papers/files/nips20/NIPS2007_0770.pdf 55 Second Order Bilinear Discriminant Analysis for single-trial EEG analysis adam advances aihara analysis application augmentation august based becker bilinear biomed biomedical birbaumer blankertz boosting brain cambridge categorization cation christoforos christoforou clas classi classifying clin combined commands communication competition component computer conference control cortically coupled culty curio december decision decoding detection device diagram diettrich discriminant discrimination dornhege during dyrholm editors engineering error fast february flor gerking gerson ghahramani ghanayim hand high hinterberger hoffman ieee image imagined improving information interfaces interfacing international iversen january journal june kazuyuki klaus kohlmorgen kotchoubey krauledat krepki kubler kunzmann learn learning lemm linear logistic losch ltering lters lucas mach machine mads magazine making marios mark matrices mcfarland mller motor movement muller nature neuper neural neurophysiol neuroscience optimal optimization paced pages paralysed parra paul perceptual perelmouter performance perspectives pfurtscheller philiastides platt press processing progress ramoser rapid ratcliff rates references regression regularization rehab rehabilitation representation robert roger ryota sajda schalk schfer schlogl scholkopf schroder search signal single spatial spatio spatiotemporal spectral spelling state systems task tasks taub temporal throughput timing tomioka towards trans transactions trial trials uller vaughan vision wagner with wolpaw http://books.nips.cc/papers/files/nips20/NIPS2007_0051.pdf 109 Nearest-Neighbor-Based Active Learning for Rare Category Detection accounting active advances agnostic anderle annual anomaly balcan beygelzimer blake bounds brazdil cambridge category coarse complexity computer conf dasgupta data databases datasets detection fine gama html http identification information irregularities kumar kumaraswamy laboratory langford large learning liacc machine mansour merz mining mlrepository moore multiple neural niaad output pages pelleg proc processing rare references report repository sample sampling scale shuttle statlog steier systems technical theory trees tutorial university http://books.nips.cc/papers/files/nips20/NIPS2007_0780.pdf 47 An Analysis of Inference with the Universum advances algorithm approach berlin bernhard biological birbaumer bottou brain cambridge category chapelle chapter classification classifiers classifying collobert comparison completely computer conf conference cybernetics darmstadt ecog editor editors elger engineering extraction fast feature fisher fukushima gaussian gunnar hill hinterberger idiap ieee implementation inference information interdaces interfaces international invariant isbn joint jordan kernel klaus kubler lawrence learning least letters line logos machine machines martigny mathematical methods michael mika millan mochty model muller need neil networks neural nijboer nips noise null optimization page pages paralysed press probabilistic proc proceedings processes processing programming published ratsch references rehabilitation robert scholkopf schroder sebastian semi series signals sinz smola software sollich spaces squares subject subjects supervised support suykens switzerland systems thesis training transactions transductive university universum vandewalle vapnik vector verlag weston widman wilhelm with without zhong zien http://books.nips.cc/papers/files/nips20/NIPS2007_1082.pdf 243 Variational Inference for Diffusion Processes academic accelerated accepted advanced advances alexander algorithm analysis annan approach approximation apte archambeau assimilation atmospheric barber based bayesian berlin beskos biometirka bishop carlo christopher complexity component computational computationally conference cornford correction crisan data dempster differential diffusion discretely discussion dynamical dynamics earth eckhard editor edwards efficient ensemble equation equations error estimation exact expectation eyink fearnhead field fields filter filtering from gaussian gauthiez ghil girolami golightly hairer hargreaves hastings incomplete independent inference intermediate jazwinski jorge journal kalman kloeden kushner laird lappalainen learning likelihood linear lyons machine marsh maximum mean metropolis miller miskin model modelling models monte multivariate nocedal nonlinear numerical observed ocean opper optimal optimization pages papaspiliopoulos parameter partially particle pattern peter physica physics platen posterior press probability proceedings process processes recognition references related research restrepo roberts royal rubin sampling sciences series shawe smoothed society solution springer statistical statistics stephen stochastic stramer stratonovitch strongly stuart switching system systems taylor theory time using verlag voss wilkinson with workshop wright york http://books.nips.cc/papers/files/nips20/NIPS2007_0349.pdf 180 Scan Strategies for Adaptive Meteorological Radars adaptive agile ahead aintec amherst applications approach approaches architecture autonomous barto beam behavior berger berkeley cambridge clutter coarse coates coding colom comparison conference control dcas detection development diel document donovan eagleson education engineering events examples experimental feedback filters flight ganapathi generalization grupen hazardous helicopter howard html http huber icassp identification ieee improved international introduction inverted iros isham iturbe kalman keepaway kreucher kuhlmann kurose kwok learning liang limited line london lookahead lyons mahadevan manfredi manoeuvering marrero massachusetts mathematical mclaughlin meteorological meteorology model models moran multi multistage murphy musicki myopic network nips pages pepyne phillips physical pomdp prediction press proceedings puerto radar radars rainfall rainstorm references reinforcement report requirements research resources response responsive rico rlai rltoolkit robocup robotics rodrigues royal scala scan scanning scheduling schulte sciences secon sector sensing sensitivity sensor sensors series simple soccer society software solution space sparse spatial step stone strategies structure student successful survey sutton suvorova switching symposium system systems targets tasks technical techniques temporal test through tile tiles time trabal tracking ualberta user using vega water waveform weather westbrook zink http://books.nips.cc/papers/files/nips20/NIPS2007_0760.pdf 273 --PREPRINT-- advances agglomerative analysis annals annealed annotated annual applications applied approach association atlas bayesian campbell carlo classification clustering coalescent coalescents college collisions computational comrie conference data daume defining department diffusion dirichlet discovering distributions doucet dryer duda editors engineering essays expression fearnhead filter freitas friedman from gene genealogy ghahramani gordon griffiths hart haspelmath hebrew heller hierarchical hierarchies implications importance information international journal kemp kingman language large learning linguistics machine mansinghka mcmahon mcmc meeting merton method methods mixture model modelling monte multiple neal neural numbers oxford pattern pcluster pitman populations practice press priors probabilistic probability proceedings processes processing profiles references relational report sampling scene science semi sequential sons springer statistical statistics stochastic stromsten structures supervised systems technical tenenbaum their theory thesis toronto trees typological university using verlag volume wiley williams with world york http://books.nips.cc/papers/files/nips20/NIPS2007_0585.pdf 303 Exponential Family Predictive Representations of State aaai aamas actions agents analysis approximate artificial autonomous bayesian berkeley computation conditional conference continuous contrastive data determinant discovery discrete divergence dynamical editors entropy experts exponential extraction families features fields freitag future gaussian grandy graphical hinton icml ieee inducing inference information intelligence international iteration jaynes jordan journal labeling lafferty lagoudakis learning least linear littman machine markov maximum mccallum methods minimizing mixtures models multiagent national neural nips nonlinear notes observations pages parr pattern pereira pietra policy predictive present probabilistic processing products prospects random references relaxation report representations research rudary schick segmentation segmenting sequence signal singh squares state status stochastic sutton systems technical training transactions uncertainty variational wainwright wingate with http://books.nips.cc/papers/files/nips20/NIPS2007_0663.pdf 265 Adaptive Bayesian Inference acar acids adding adjusting alagona alenex algorithm algorithms although analysis annual appear application applications approximate april artificial atom bank belief berman between bhat biol biology blelloch blume bounds bourne building case century change chem clifford cluster computation computational computer computing conference consistency contraction curr data delcher deleting design discrete disorder distributive dunbrack dynamic dynamizing each edges editors efficient energy engineering estimates expensive experimental experimentation factor factors feng field fields figure folding force foundations francisco free frey from gary generalizations generalized gilliland graphical graphs grimmett grove harper history ieee implementation independence inference information intelligence intelligent international jaakkola john jordan jorge journal kamisetty kanat kasif kaufmann kollman kschischang langmead language learning libraries loeliger logarithmic machine march marina markov matthias maverick mceliece mechanical meila michael miller mixtures models molecular more morgan naive networks neural nucl nucleic october opin oxford pages parallel pearl performance physical plausible pldi plot press probabilistic proceedings processing product profeta programming propagation protein proteins queries query random reasoning recomputing references reif research restructuring robert rotamer science scratch self shindyalov siam sigplan simulation singh slightly soda static statistical statistics struct structures subsequent symposium systems tangwongsan than theory time times transactions tree trees umut university update updates updating using vittes wainwright weiner weiss weissig welsh westbrook willsky with workshop xing yanover http://books.nips.cc/papers/files/nips20/NIPS2007_1057.pdf 126 Density Estimation under Independent Similarly Distributed Sampling Assumptions acta american analysis annals applied approach association award beal bengio between bhattacharyya blei bull calcutta chapman collins components concave dasgupta data defined density designed devroye dirichlet discrimination distributions divergence efron estimation exponential families family fitting functions gaussian generalization glad gyorfi hall hierarchical hjort howard inequalities infinite information jebara john jones jordan journal kernel kernels kondor larochelle learning local logarithmic london machine manifold math mathematics measure measures mixture model naito neural nips nonparametric olking parametric part parzen populations prekopa press principal probability processes processing product pure rasumussen references related research schapire semiparametric silverman smoothing some specially spiegelman start statistcal statistical statistics supported systems their tibshirani topsoe using view vincent wand wiley windows with work http://books.nips.cc/papers/files/nips20/NIPS2007_0431.pdf 26 Draft of October 2007 for NIPS Pre-proceedings. Final version may differ agakov aistats analysis anton appear applications approximation april bakker bart baxter bayes bayesian berlin bias bishop bonilla cambridge candela carl caruana charles christopher clustering collaborative component conference coregionalization covariance discriminative easier edition edward edwin environmetrics estimation evgeniou factor features felix first from gating gaussian geostatistics hagan hans heskes hierarchical inductive informative international introduction jair january joaquin john jonathan jordan journal july june kernel kernels kriegel large latent lawrence learn learning likelihood linear link machine machines march markov massachusetts massimiliano matthias maximum methods micchelli michael minka model models multi multiple multitask multivariate neil nips nottingham ordinal pages peter picard platt point pontil prediction press principal probabilistic proceedings process processes property quinonero rasmussen references regression relational report research rich rosalind royal scale schwaighofer seeger semiparametric series sets shipeng society spatial specific springer statistical statistics stochastic structures task tasks than theodoros thing thomas thrun tipping tresp university using vector verlag volker wackernagel whye williams with zhang zhao http://books.nips.cc/papers/files/nips20/NIPS2007_0747.pdf 310 A General Boosting Method and its Application to Learning Ranking Functions for Web Search accurately algorithm annals approximation artificial athena boosting boundaries clickthough clickthrough colt combining computation conditional conf conference data descent documents edition efficient empirical engines evaluation feedback fields function gradient greedy highly icml implicit intelligence interdependent interpreting intl journal large learning machine margin methods minimization neural nonlinear optimizing order ordinal output preferences proc programming random rank ranking regres relevant research retrieving risk scientific scoring search second sigir sigkdd sion statistics structured things training tree using variables vayat xuayx http://books.nips.cc/papers/files/nips20/NIPS2007_0535.pdf 221 On Ranking in Survival Analysis: Bounds on the Concordance Index adults analysis annals applications biometrics biometrika bulletin burges chapman comparisons conference cortes data december deeds descent discussion estimates failure gradient hall hamilton harrell hospitalized hullender individual internal international interscience journal kalbfleisch knaus larger lazier learning life likelihood linear logistic lynn machine mann mathematical medicine methods model modeling models networks nocedal numerical oakes objective optimization other partial prentice proceeding prognostic random rank ranking references regression renshaw royal series seriously shaked society springer statistical statistics stochastically strategies support survival tables test than time using vapnik variables vector whether whitney wilcoxon wiley with wright http://books.nips.cc/papers/files/nips20/NIPS2007_0560.pdf 8 One-Pass Boosting aaai algorithm algorithms analysis application attribute attributes base bayes boosting categorization classification classifiers colt comparison comput confidence dasgupta decision diverse duda errors event experiments freund generalization hart icml improved jcss learning line linear littlestone long machine majority mccallum models naive nigam noisy pages pattern predictions rated redundant references scene schapire singer text theoretic threshold using weak wiley winnow with workshop http://books.nips.cc/papers/files/nips20/NIPS2007_0706.pdf 81 Sequential Hypothesis Testing under Stochastic D e a d lin e s analysis anim annual approximate behav bogacz boyd cambridge cognitive conference convex curses detection dimensionality dynamic elementary estimation gold inferring introduction luce math mental mozer neuron optimization oxford poor powell press proc process programming psychol pyschol rakitin ratcliff references response role rouder science sequential shadlen siegmund signal sixth society solving springer statisti their times twenty univ vandenberghe verlag wald wiley wolfowitz http://books.nips.cc/papers/files/nips20/NIPS2007_0060.pdf 31 FilterBoost: Regression and Classification on Large Datasets accuracies achieve adaboost adaptive additive adult advances affects algorithm algorithms allow annals annual application arcing batch best blake booster boosters boosting bounded bregman breiman bshouty california cause classification classifiers collins combination compares competitive complicated computation computational computer conference confidence convex covertype data databases dataset datasets decision dept discovery distances distributions domingo duality each efficient especially fenchel figure filterboost filtering freund friedman galvada games gave gavinsky generalization generally hastie hettich higher however html http ieice improved information irvine journal knowledge larger learn learner learning less line linear logistic machine madaboost majority merz methods mining mlearn mlrepository modification more most much neural newman outperform overly perform performance polynomially poorly predictions problem processing rated references regression repeated repository represented resampling research results sampling scaling schapire science sciences section shalev shwartz similar similarly simple singer slowly sometimes statistical statistics stumps system systems techniques than theoretic theory this thus tibshirani trans trees twonorm using vanilla variants view watanabe weak well when which while with http://books.nips.cc/papers/files/nips20/NIPS2007_1002.pdf 63 The rat as particle filter academy account acquisition additivity advances algorithm analysis andrieu animal annual appleton approach asme autoshaping away backward balsam basic bayesian been behavior bernardo between biological black blocking bouton cambridge carlo causal century classical cognition cognitive comparative computational computing conditioning conference contingencies contingency courville crofts current curve dayan degroot discrepancy discrimination distributions domain doucet doya editors effect effectiveness engineering enhanced expected experimental explaining extinction fairhurst filtering forward frohardt gallistel general godsill gordon griffiths human implications induction information journal judgement judgment kakade kalman kemp latent learning lindley linear lovibond magnitude matute memory methods miller mitchell model monte national neocortex neural neurobiology opinion oxford pages pavlovian perfors physiological posterior prediction press problems proceedings processes processing prokasy psychological psychology quantitative quarterly references reinforcement rescorla research resolution review reward rubin sampling science sciences sequential shanks significance similarity simulate smith society space statistics strength structure structures systems temporal tenenbaum theory touretzky transactions uncertainty unexpected university using variable wagner weight york http://books.nips.cc/papers/files/nips20/NIPS2007_0160.pdf 69 Bayesian binning beats approximate alternatives: estimating peristimulus time histograms actions advances analysis andrews area arxiv auditory baker barraclough bayesian baylis berger brain bruce caan cambridge coding cognitive computation constant cortex course decision desimone different discriminating distribution dritschel editors endres expl face faces foldiak fukada functional functions gross handle head histogram hoffman http hutter idsia ieee images inference inferotemporal information integration intel journal latency leonard linux lobe macaque math method monkey moriya mutual neocortex neural neurons neurophysiology neuroscience objects optimizing oram pages payne perrett philosophical piecewise platt polysensory precision press processing properties psychology recipe references regression report response responses responsive role rolls royal saito scholkopf school selecting series shimazaki shinomoto sight signals size society springer statistical subdivisions sulcus superior suse systems tanaka technical temporal theoretic theory thesis time tools transactions unique university views visual xeontm xiao york http://books.nips.cc/papers/files/nips20/NIPS2007_0472.pdf 6 Progressive mixture rules are deviation suboptimal ability adaptive advice aggregating aggregation aleatoires algorithm algorithms analysis annual approach arbitrary audibert available averaging barron bayes better bianchi bias blanchard bound bounds bunea catoni cesa classification combining communication computation computational computer concentration conconi conditional conference consistent control convergence cover data dependent determination devroye different edition editors empirical estimator estimators exact expert from functions game general generalization gentile gopinath gyorfi haussler henri html http ieee index individual information inst journal juditsky jussieu kivinen laboratoire learning lecue line lmens loss lugosi mathdoc mean minimax minimization mirror mixture model modeles multivariate nobel nonparametric online open pages paris pattern penalized poincare prediction preprint preprints proba probab probabilistic probabilites problems procedures proceedings progressive randomized rates recognition references regression report rigollet risk rules sciences selection sequences sequential springer stat strategies suboptimality system technical theoretic theory trans transactions trees tsybakov under universal universites variance verlag vovk warmuth wegkamp with workshop yang zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0243.pdf 287 Scene Segmentation with CRFs Learned from Partially Labeled Images advances analysis appear appearance approach aspect based bayesian belief berg blake carbonetto carreira categorylevel challenge challenges class classes classification coloring colour computer conditional conference context corel criminisi cues cuts cycles data databases distinctive distributions dorko environment european everingham extraction feature features field fields figure first foreground forsyth framework freitas frey from geman gibbs grabcut graph graphics graphs groen hebert heuvel hierarchical histogram ieee image images indian information integration intelligence intelligent interactive international invariant iterated jansen joint journal keypoints kolmogorov kuck kumar labeling labelling lafferty lazebnik learning local lowe machine mackay mark markov marszalek mccallum modeling models msrc multi multiscale neural object pages pascal pattern pereira perpinan ponce probabilistic proceedings processing propagation random recognition references region relaxation restoration revolution road rother russell samples scale schmid schroff segmentation segmenting selected semi sequence shape shotton single sowerby spatial stochastic supervised systems terrain textonboost torralba toward transactions transportation triggs type unified using verbeek vision visual volume weijer williams winn with workshop zemel zhang zisserman http://books.nips.cc/papers/files/nips20/NIPS2007_0612.pdf 132 COFI R A N K Maximum Margin Matrix Factorization for Collaborative Ranking about above again algorithm allows along applied arbitrary argsort argument associated assumptions before between beyond bound caring case cases computations compute concatenate containing convex cost cutoff defined definition dependent described directly domain efficient efficiently else enumerated exist expected exponentially fact form general given gradient halflife have here higher however implementation incurred index initialize input lines list loss lower majorization matrix means measure ndcg need neru neutral normalized object observations optimization order ordinal other otherwise output pairs partial particular permutation position positions preference preferences procedure quicksort rank ranked ranking relations rely rescale same score setting similar similarities small stop straightforward sufficiently than that then these this total under upper utility variant vectors viewing vote weight whenever where which while with words write http://books.nips.cc/papers/files/nips20/NIPS2007_0054.pdf 99 Learning and using relational theories advances algebra analysis appearance applications argonne aspects austin based bayesian bruner cambridge capacity carey change chater chicago childhood chomsky cognition cognitive cogsci complexity concept conceptual conklin decisions description edition editors edmonds feldman generalization generalizations gerken goodman goodnow griffiths grunwald guide human induction inductive infant inference information journal krueger laboratory language learning length likelihood limits linguistic logic logical mace machine magical manchester manual mccune measures memory methods miller minimum minus muggleton multiple myung national naturalness number organization patterned pennsylvania perception perceptual pitt plus possible press principle principles processing programming psychological raedt rational reconciling reference references relevance report representation review rule science sequences seven similarity simon simplicity some structural structure study symbols syntactic technical tenenbaum theory thesis thinking tics unifying university vitanyi when wiley witten http://books.nips.cc/papers/files/nips20/NIPS2007_0195.pdf 314 Compressed Regression access acoustics aggarwal agrawal algorithmic algorithms angle annals antenna applied approximation approximations april asilomar august automata baraniuk based berkeley bernoulli candes capacity castro classification colloquium communication communications comp compressed compressive computation computers conf conference confidentiality consistency control dalenius data database davenport department design detection differential dimensional disclosure distributed donoho dual duarte duncan dwork efron engin enhancing fading feigenbaum flat from fudge future good graph greed greenshtein hastie haupt high hochwald icalp ieee inaccurate incoherent incomplete info information international ishai january johnstone journal kargupta karr knowl languages lasso learn least linear link mach malkin marzetta mathematics measurements meinshausen methodology microdata mining mobile model modelling multiparty multiple multiplicative nissim noisy nowak october osborne over pages parametrization pearson persistency perturbation predictor preserving presnell principles privacy proc proceedings processing programming projection projections prospects protecting pure quantification random rayleigh recovery references regression reiter report representations research results ritov romberg ryan sampling sanil science secure selection sensing sharp shrinkage sigkdd signal signals sparse sparsity speech stable stat statist statistical statistics statistik strauss symposium systems technical tenth theory thresholds tibshirani tidskrift towards trans transactions tropp turlach type virtue wainwright wakin while wright zhao http://books.nips.cc/papers/files/nips20/NIPS2007_0707.pdf 95 A configurable analog VLSI neural network with spiking neurons and self-regulating plastic synapses which classifies overlapping patterns addison amit analog annunziato badoni biological brader chicca circuits computation cybernetics dante engineer fusi giudice giulioni ieee indiveri international iscas journal mattia mead mongillo networks neural neuromorphic newsletter pages paris physiology press proc references salamon senn symposium systems transactions vlsi wesley whatley http://books.nips.cc/papers/files/nips20/NIPS2007_0290.pdf 232 Markov Chain Monte Carlo with People acoustical adaptive affect ahumada alfonso america analysis anderson applications appropriateness ashby attention australian barker between biometrics biometrika block bound bradley brainard bush calculations carlo categories categorization chain chains chapman character chater chemical clarke classification cognition cognitive communication comparisons computing confusion constant context decision density detection distance distribution economic economist editors electron elman equations erlbaum estimation exemplar experimental fast featural features functions galanter general generalization generative gilks hall handbook hastings hedges hillsdale hopkins huttenlocher ideal identification incomplete information integral integration into issue john journal judgment kersten learning london lovell luce machines maddox markov massaro matching mathematical matrices mcclelland medin memory method methods metropolis model models monte movies multidimensional nosofsky numbers oaksford objects observers oden olman oxford pages paired pattern pelli perception perspective physics plasma practice press probabilistic probability processes proton prototype psychological psychology psychometrika psychophysics radial rank ratio rational recognition reed reese references relating relations relationship response results review richardson rosenbluth rule sampling schaffer science sciences shepard signal similarity society software some sons space spatial special speech spiegelhalter state stimuli stimulus stochastic suffolk surveys taste teller tenenbaum test their theory thought toolbox trace transforming trends university using vevea videotoolbox vision visual volume vulkan wiley york yuille http://books.nips.cc/papers/files/nips20/NIPS2007_0919.pdf 112 Regulator Discovery from Gene Expression Time Series of Malaria Parasites: a Hierarchical Approach acids adai after algorithms altman american among analysis anders apicomplexa approaches approximate aravind association averaged babu balaji bayesian beal bild binding bioinformatics biology biostatistics botstein bozdech brown cantor carvalho cell cerevisiae chloroquine comparative components comprehensive control coulson cultures cycle derisi discovery domains dynamic editors eisen engineering estimation evolution expectation expression expressions factors faith falciparum family futcher gardner gene genes genome genomics george gibbs gunasekera hall hastie heskes hidden human hybridization identification implication inference integrase iyer james journal life llinas lucas malaria mcculloch methods microarray microarrays minka missing mixed modelling molecular muller myrick networks nevins nucleic ouzounis pages parasite parasitol park perturbations physics plasmodium principal profiles propagation proteomics references regression regulated regulation research reverse reviews roch sabatti saccharomyces sampling selection sherlock sinica sparse specific spellman springer stage statistica statistical strains their thesis three tibshirani transcript transcription transcriptional transcriptome treatment troyanskaya value vannucci variable variational wang west whole wide winzeler wirth wong yeast zhang zoeter http://books.nips.cc/papers/files/nips20/NIPS2007_0038.pdf 78 Optimal models of sound localization by barn owls acad acknowledgments acoust acoustic advances alba ambiguities ambiguity annu arthur associates auditory barn bases bayes behavior believing binaural biol blasdel brainard broadband caltech cambridge chapter characteristics coding coil colliculus comments comp computations concurrent contribution cues deficits dependence derivation developing difference differences distribution distributions duda editors elevation elimination environments erlbaum esterly euston evans expectations experiments farahbod fields fischer from function functions hartung hastings head hearing human identification illusion induced inference inferior influence information instruction intensity interaural jersey jose keller klaus knudsen konishi lawrence leading lesions level liam localization location louis luis maps mark mazer measured measurement mechanisms merging midbrain mises model natl nature nelken neural neuron neurosci noise nonparametric olsen optic optimal otolarnyg owls pages paninski payne peacock pena perception phys physiol platt poganiatz press prey prior probabilities proc processing providing real receptive references related representation research resolution resolves responses saberi scholkopf science search seeing selectivity simoncelli sound sounds source space spatial specific spectrum speed statistical stocker support systems takahashi technique tectum terry thank thesis time transfer turning tyto university virtual visual wagner washington weiss wiley with witten worlds york http://books.nips.cc/papers/files/nips20/NIPS2007_0514.pdf 124 Temporal Difference Updating without a Learning Rate adaptive applications approximate barto cambridge college connectionist control controller cued delayed department differences discrete dynamic engineering environments estimation from george increamental infeng information introduction iteration journal king lagoudakis learning least line machine markov methods multi niranjan optimal oxford parr peng policy powell predict press problem programming recursive references reinforcement report research rewards rummery solving squares step stepsizes sutton systems technial temporal thesis time university using watkins williams with witten http://books.nips.cc/papers/files/nips20/NIPS2007_1074.pdf 43 Predicting human gaze using low-level saliency combined with face detection account across active adolphs advances ahuja algorithms allocation analysis applied artificial attention authors autism baddeley baluja barton based behav between bing boosted bottom bradski brain brainard breazeal brockmole buswell california cambridge careful cars cascade castelhano cerf chen chicago christensen cleary clin cohen competence components comput computational computer conference confound consistent conspicuity context contextual contrast contribute control cornelissen correlates curr dascola decision dependent detection dickinson dimitris disorders does down during early editors effect effects einhauser emotion evidence example eyelink face faces facial favor features first fischer fixation gaze gilchrist glance global goal gompel graph gregory guidance guiding harel henderson hershler high hill hochstein hoffman horizontal human ieee image images individuals information insights institute instr integrating intel intelligence intels interactions international into itti iyer joint jones journal kaehler kanade klin koch konig learning leen level library look luminance machine mack making matlab meridians meth method mind model modeling movement movements muller murray natural naturalistic navalpakkam network neural neurobiol neurol neuron neuropsychologia neurosci niebur object observers oliva olofsson open optimally orienting overt pages palmer pattern patterns people perception perona peters pictures pisarevsky platt plenum poggio predictors preference premotor press processes processing psych psychology psychophysics rapid rating real recognition recognizing references reorienting reply research riggio rizzolatti robot role roth rowley saliency samaras sampling scale scassellati scene scenes schneiderman scholkopf schultz search second selection shimojo sight simion simple situations snow social solla source spat statistical still study sung system systems tatler technology theory thesis time toolbox torralba tracking transactions tsotsos tunes umilta understanding university using vanrullen vertical view viewing viewpoint viola vision visual volkmar walther weiss when with world yang yarbus york zelinsky zhang http://books.nips.cc/papers/files/nips20/NIPS2007_0188.pdf 311 HM-BiTAM: Bilingual Topic Exploration, Word Alignment, and Translation academy admixture algorithm alignment allocation andrew annual applications approach april arbor artificial association based bilingual bing biosciences bitam blei brown chiang christoph coling computational computer conf copenhagen data david della denmark detection dirichlet donnell editors elena eric erosheva estimation exponential families field fienberg franz generalized genetics genotype haussler hermann hierarchical homology hughey improving inference intelligence john jordan jordon journal june karplus kaufmann kjaelff krogh lafferty latent learning linguistics lingustics machine mathematics mean meek meeting membership mercer method mian michael michigan mixed mixtures model models morgan multilocus national pages parameter peter phrase pietra population pritchard proc proceedings protein publications publishers references research robert russell sciences scientific sequence significant sjolander statistical stephan stephen stephens steve structure suppl template tillmann topic translation uncertainty using variational vincent vogel volume weak word xing zhao http://books.nips.cc/papers/files/nips20/NIPS2007_0346.pdf 247 A Constraint Generation Approach to Learning Stable Linear Dynamical Systems adaptive american analysis andrew applications approach archive asme automatic automatica basic bayesian berkeley bernstein boyd cambridge charles chui comp computer conf conference constrained control convex data dennis department dooren doretto dynamic dynamical edition editors engineering estimation filtering folias geoffrey gestel ghahramani global guaranteed hall handbook hinton horn horst identification ieee implementation inference intl johnson journal july kalman keogh kevin kluwer lacy learning lieven linear ljung maciejowski matrix methods mining models moor murphy networks nips online optimization overschee parameter pardalos prediction prentice press problem problems proc rauch realization references regularization report representation roger series seth smoothing soatto solutions stability stable stephen subspace suykens system systems technical textures theory thesis time toronto transactions university user using vandenberghe vision with zoubin http://books.nips.cc/papers/files/nips20/NIPS2007_0334.pdf 239 Better than least squares: comparison of objective functions for estimating linear-nonlinear models account adaptive advances also analysis analyzing another auditory average baker becker bialek biol biological biomed blowfly boer brenner cambridge cascade cells characterization class code coding coefficeint comput computation convergence correlation cortex cortical csiszar cybern david difference dimensions distrbutions distribution divergence doupe edited elements enhances estimating estimation feature features felsen ferrets field fields filtering forebrain from gallant general hammerstein hawken hungar hunter identification ieee image indirect information informatiove journal koberle korenberg kurgansky kuyper lond macaque marmarelis math maximally measures methodology miller modeling models monkey motion movement movshon natural nature network neural neuron neurons neurophysiol neurosci nonlinear obermayer observations obtained organization paninski performance physics physiological pillow plos preliminary press primary probability proc processing properties real rebrik receptive references responses revealed reverse ringach rust ruyter sapiro scene scenes schwartz sensitive sensitivity sequences shapley sharpee short signals silvey simoncelli simple singh smyth songbird sounds spatio spatiotemporal spectral spike statist steveninck stimulation stimuli strong structure stryker studia study subspace sugihara synergy syst system systems technique techniques temporal their theunissen thompson three thrun time tolhurst touryan trans transfer transmission triggered type under using vinje vision visual wiener willmore with http://books.nips.cc/papers/files/nips20/NIPS2007_0781.pdf 130 Local Algorithms for Approximate Inference in Minor-Excluded Graphs above actual adding again agreement algorithm algorithms analysis approaches artificial based bayati become belief beyond bound boundary bounds change clearly comparison competitive competitively computable compute convergent cris criss cross decomposition depend difference distortion edges elect embeddings energy error essentially estimation euclidian evaluated even everything exactly example exception excluded exhibits expected explain extra feature field fields figure flow four framework francisco freeman from function generality generalized gibbs gird given globerson graph graphs grid hyper ieee ield igure important inference info intelligence intelligent interaction isit jaakkola jordan kaufmann keeping klein kolmogorov left likely linear linearly loopy machine matching maximum measure message metrics minimization minor minors mitsubishi model morgan multicommodity neighboring network networks nips node nodes note nteraction obtained only optimality order outperforms parameter partition passing pattern pearl perform planar plausible plot plotkin plotted preserving probabilistic product programming propagation proved reasoning references related relative remain remains reparameterization replaced respect results reweighted right robustness running same scalability scales setup shah sharma shown shows side similar small smaller specifically stoc strength strengths structure systems tags tatikonda than that theoretical theoretically theory there these this though through time times trans transactions tree trees uncertainty under value values varying very volume wainwright weaker weight weiss which while will willsky with yedidia http://books.nips.cc/papers/files/nips20/NIPS2007_0581.pdf 206 A Risk Minimization Principle for a Class of Parzen Estimators adaboost advances aistats algorithms analysis annual approaches artificial bartlett based boundaries bounds brabanter cambridge classifiers colt complexities computational conference conover cristianini cuts devroye distribution dual eleventh engineering faculty fifteenth further garg gaussian gestel ghahramani graepel graph gression gyorfi herbrich icml ieee iman information intelligence international journal juan kaufmann keerthi kernel kernels koltchinski large learning least leuven linear lugosi machine machines margin margins mendelson methods minimization moor morgan muller networks neural obermayer onoda ordin ordinal pages pattern pelckmans penalties press primal probabilistic proc proceedings processes programming publishers puerto rademacher rank ratsch recognition references regression research ression results rico risk roth scholkopf scientific shawe singapore smola soft specht springer squares statistics structural support suykens taylor technometrics theory thesis transactions transductive transform tribution twelfth university using vandewalle vector verlag with world http://books.nips.cc/papers/files/nips20/NIPS2007_0983.pdf 18 Invariant Common Spatial Patterns: Alleviating Nonstationarities in Brain-Computer Interfacing abnormal academic acquisition actual actuated advances alternative alvino analysis andrews approach approachs arch based basic berger berlin biomed biometrika birbaumer blankertz bler boosting boston brain canonical chicago class classification classifications classifying clin clinical cognitive combination comparison competition completely components computer control correlation critchley curio curran desynchronization detection differentiation discrimination dornhege driving ecog effective electroencephalogr elektroenkephalogramm elger encephalography engineering event extraction fast feature filters fukunaga functions gerstner hampel hill hinterberger human ieee implementation influence information integration interface interfacing introduction invariant invasive jasper jonsrude kawanabe kernel koles krauledat krusienski learning leen lemm linear lkopf ller magazine mapping menschen mika mill mobile mochty multi munich nervenkr neuper neural neuroimage neurol neurophysiol nijboer nonparalysed normal occipital oldenbourg optimizing osman owen paradigms paralysed parra pattern pearlmutter penny performance perspectives pfurtscheller pilot precentral press principal principles problems proc processing progress psychiat psychometrika quantitative rates recognition references regions rehab rehabilitation related renkens roberts robot robust romanazzi ronchetti rousseeuw sajda schalk schl schr signal signals silva single smola solla spaces spatial stahel statistical statistics stokes study subject subjects support sykacek synchronization system systems tang tasks tomioka topographic training trans transactions trial trials tsch untrained validating vaughan vector verlag weston widman wiley wilhelm without wolpaw yeung york http://books.nips.cc/papers/files/nips20/NIPS2007_0988.pdf 203 CPR for CSPs: A Probabilistic Relaxation of Constraint Propagation algorithm algorithmic algorithms analytic approach artificial bacchus beek belief binary boolean braunstein chapter characterizing chen constraint constraints dechter descriptions drawings edition equations equilibrium from generalizations generating hall inference insight intelligence intelligent into iterative jstat july kaufmann kumar local look magazine maneva mateescu mcilraith methods mezard modern morgan mossel networks norvig pages parisi pearl plausible prentice probabilistic problems processing propagation random reasoning references report russell satisfaction satisfiability scenes science second semantic sept shadows simple solution structures success survey systems technical thesis wainwright walsh waltz with zecchina http://books.nips.cc/papers/files/nips20/NIPS2007_1055.pdf 138 Feature Selection Methods for Improving Protein Structure Prediction with Rosetta andrew angle annals attainment baker biopolymers bonded boyan bradley casp chivian chris conditions david dictionary discussion dylan efron evaluation experimental features free functions geometrical hastie hydrogen iain improve jack jens johnstone journal justin kabsch kira lars lasso learning least local machine malmstrom meiler misura modeling moore optimization optimum pattern phil protein proteins qian recognition references regression research robert rosetta royal sander schonbrun search secondary selection series shrinkage society statistical statistics structure tibshirani trevor wilson with wolfgang http://books.nips.cc/papers/files/nips20/NIPS2007_0524.pdf 146 A Randomized Algorithm for Large Scale Support Vector Learning abstract algorithm algorithmic algorithms analysis annual anupam application arriaga avrim balcan balcazar bennett berkeley bernd blum bredensteiner clarkson classifiers combinatorial computational computer concepts conf conference contemporary dasgupta dimension discrete duality elementary extensions fast florina foundations gartner geometric geometry gupta high hilbert icdm ieee integer international into johnson jose journal kenneth kernels learning lemma lindenstauss lindenstrauss linear lipschitz lowdimensional machine machines mappings maps margins maria mathematics moderately nature optimization osamu pages pellegrini press problems proc proceedings programming projections proof provably random randomizing references report rning sampling sanjoy santosh science siam simple small soda space springer statistical subexponential support symposium technical technique theory training twelfth vapnik vector vegas vempala watanabe welzl when yang york http://books.nips.cc/papers/files/nips20/NIPS2007_1100.pdf 111 Random Projections for Manifold Learning academy advances analog analysis anupam appear approximations architecture attractors august baraniuk baron berkeley bernstein bickel california camastra candes circuits compressed compressive computational conference conversion costa dallas dasgupta data dcas demodulation dimension dimensional dimensionality donoho duarte eigenmaps elementary embedded embedding entropic entropy estimation estimators exact foundations framework frequency from geodesic geodesics geometric global graph graphs grassberger grimes gupta hegde hero hessian high highly icip ieee image imaging incomplete info information international intrinsic kegl kelly kirolos landford langford laska learning lemma levina likelihood linear locally manifold manifolds massoud mathematics maximum measuring methods national nips nonlinear numbers packing pages pattern phenomena physica physical precision press principles proc procaccia processing projections proof proofs ragheb random recognition reconstruc reduction references report review rice robust romberg roweis sanjoy sarvotham saul science sciences sensing september signal silva smooth stanford statistical strange strangeness survey systems takhar technical techniques tenenbaum theiler theory tion trans tree uncertainty university using volume wakin workshop http://books.nips.cc/papers/files/nips20/NIPS2007_0121.pdf 216 Kernels on Attributed Pointsets with Applications akihiro albums algebraic alvey amnon analysis anderson angles annotation application applied approach approximation automated available benavente between biology bischof blackford borgwardt california chang chellappa chen chih chung cjlin combined comparison comput computational computer conf conference convolution corner croz cruz csie cvpr data database david demmel discrete distinctive dongarra edge edition eidhammer eigendecomposition face faces family features fifth from gabor geometric graph graphs greenbaum guibas guide haim hammarling hans harris hashing haussler hazan helmut hisashi http human icdm icml ieee image industrial inference information inge ingvar inokuchi intelligence international interpolation invariant isidore jebara jonassen journal karsten kashima kernel kernels keypoints koji kondor kriegel kyoung labeled lapack learning leonidas library libsvm lior literature local lowe machine machines marginalized martinez matching mathematics mckenney mercer mining neural nips object ocal over overview pages park path pattern patterns peter philadelphia phillips principal problems proc proceedings processing recognition references report representation representations research rigoutsos risi rnel rosenfeld sang santa scale sets shapes shashua shinji shortest sing siwei society software sorensen stephens struct structure support surv survey systems tamir taylor technical tector third tony tpami transactions tsuda twentieth umeyama university ures users using vector vectors vision washington wavelets weighted william with wolf wolfson zhang zhao http://books.nips.cc/papers/files/nips20/NIPS2007_0989.pdf 249 Combined discriminative and generative articulated pose and non-rigid shape estimation accurately agarwal analysis andriacchi anguelov animation annealed articulated automatic baker balan based belongie between bhatia black blake blue body bottom capture cheung column comparison completion computer conference constraints corazza cvpr dark darrell davis defined denotes density descriptors detailed deutscher discriminative discriminatively distance distribution down estimated estimating estimation example examples extended face figure filtering from fully generative gesture graphics grauman haussecker hierarchical human iccv ieee illustrates image images inference inferring initial intelligence interaction into isard joint kanade kanajujia kanaujia kinematics knuckles koller learning left light limbed local loose machine malik maps matching measuring metaxas middle mixture model modeling models monocular motion movement muendermann nips objects obtained onto orange over overlap particle pattern people plankers poel poppe pose processes projection propagation puzicha recognition reconstruction recovering recovery references refining regions regressors reid repository respectively results right rodgers rosales roth scape sclaroff search semi shakhnarovich shape shapes shown shows sigal silhouette silhouettes simultaneous sminchisescu soft span specialized srinivasan state statistical stochastic structure subjects supervised that then this thrun tracking trans transactions triggs using video views vision visual visualizing where with workshop http://books.nips.cc/papers/files/nips20/NIPS2007_0442.pdf 71 A Probabilistic Mo del for Generating Realistic Lip Movements from Sp eech acoustics active addison alan algorithm analysis animation annual appearance application applications applies applying automatic bangham barber basso bayesian because below between blanz brand bregler british cawley chain coefficient coefficients comput compute computed computer conf conference cooper cootes correction covariance current david december denote described design diag diagonal differentiate done dpds duchnowski dynamic dynamical edwards eigenfaces equations estimation exactly expectation ezzat face faces following forecasting found francisco full function geiger general give given gives glauert gradient gradients graham graphics harrison hear hearing here hidden hild however icassp icslp ieee image images improving indicating inference input integrating intel interactive interpreting jeff journal kaufmann learning letter ligence likelihood linear lipreading lips macdonald machine manke markov matrices matthews maximisation maximised mcgurk meier mike model models morgan multiplicative nature notation observation other pages parameter parameters pattern pentland philosophy poggio poritz predictive press principle proc proceedings processing publishers publishing puppetry rabiner readings reanimating recognition references repeatedly research respect rule same seeing selected sequence series shape shared siggraph signal simplicity single smoothed solving speech springer states superscripts switching synthesis system systems takes taylor techniques temporary that their then theobald there this time toolkit trainable training transactions turk tutorial underst used using value values variable variables vetter video videorealistic vision visual voice voices weibel wesley west what when where which while with work york young http://books.nips.cc/papers/files/nips20/NIPS2007_0368.pdf 10 Comparing Bayesian models for multisensory cue combination without mandatory integration across alais among amounts angle article association audio audition auditory automatically balancing bayesian beck beers behav beierholm benefits bermant bertelson bias bimodal biol bouyer brain bresciani bull burr causal certain chem choe cleaves codes cogn compellingness computational conflict constraints control costs cross cues curr dammeier decision degree dependency depth determinants direction discordance discrepancy displacement dominance drewing effect effects ehrenstein environ ernst events evidence excess excited experimental experimentally feeling figure flash from fusion gelder genosar gepshtein ghahramani gilford guski hairston hear heron huppert illusion immediate implications induced inference influence influences information institute integrated integration interaction intersensory jack jacobs journal judgements juola kheddar kinet knill kording ladavas large latham leiderman lewald localisation massachusetts maury mccarthy mcgraw mixture modal model models modulate motion multisensory near neglect neurophysiol neuropsychologia neuroreport neurosci optimal patients pavani percept perception perceptual phys pick plos population position pouget print probabilistic proc proprioceptive proton psychol psychophys psychophysics quartz radeau rate recanzone references resolving response results roach roberson robust role schirillo senses sensorimotor sensory separation sequences shams signals sittig skills slant slutsky sound space spatial spatio spectrosc state stein step stereoscopic stimulus strategy structure studies study supported tactile technology temporal tenenbaum testing texture theory thesis thomas three thurlow time touch transfer transitivity trends under unifying unilateral upon vaughan ventriloquism ventriloquist vision visual vroomen wallace warren welch what with wolpert http://books.nips.cc/papers/files/nips20/NIPS2007_0559.pdf 85 Kernel Measures of Conditional Dependence academic advances algorithm algorithmic amer analysis anonymous appear authors bach baker based berkeley borgwardt bousquet california canonical causal component conf consistency correlation covariance cressie cross data dependence dept dimension dimensionality discrete edwards efficient estimating fine fukumizu functional goodness graphical grassberger gretton herbrich hilbert holland horth independence independent influence information intern introduction janzing joint jordan kernel kraskov learning machine machines math measures measuring method methods modelling multivariate mutual nips norms operators physical press probability problem proc rank rasch read reduction reed references regression renyi report representations reproducing review sample scheinberg schmidt scholkopf simon smola spaces springer statistical statistics steinwart stogbauer submitted supervised support tech test theory training trans university using vector verlag with york http://books.nips.cc/papers/files/nips20/NIPS2007_1109.pdf 260 An in-silico Neural Model of Dynamic Routing through Neuronal Coherence academic achieve activity advances amplification analogue anderson appropriate archie arranged arthur attention auditory balaban based bharucha blindness boahen bonhoeffer buzsaki cells chapter chen circuit coexist cognition cognitive coherence communication complex composites computational computations connell content context cortex cortical could cybernetics defined derive deutsch differences digital direction does domains double douglas draguhn dynamic dynamics electrical emerging engineering essen everything evidence foundations frequency fries from fukushima general grenfell grinwald hahnloser harris hastopoulos head hemmen http human ieee individual information inspired integrated interaction intradendritic invariance invariant journal krumhansl lakatos learning like mahowald mckone mechanism mediate mills miyake modalities model modeling module motor multiple multisensory music musical naming nature naval neets neocortex nets network networks neural neurobiological neuron neuronal neuroscience object objects olshausen online orientation oscillations oxford particularly patel pattern patterns paulsen perception phys pinwheel pitch placing press primary priming principles problems processing propagating propose psychology psychophysics published publishing radio recognition references reflect repetition ring robbins rotated routing rubino ruderman sarpeshkar schroeder science sciences sejnowski selection sensory sequence series seung shift sholkopf silicon size structure suitable summary system systems temporal that through tier timing tonality tone tpub training transactions transfer translation trends tuning university used visual waves weiss wiskott york http://books.nips.cc/papers/files/nips20/NIPS2007_1007.pdf 230 DRAFT. A revised version will appear in NIPS 2007. aaai advances alberta analysis andriy application approximations aston august banff benjamin bernhard bishop boltzmann bonn brendan california cambridge canada carlo chain christopher collaborative component computation computer computing conference delbert department dept dueck editors exponential factor factorization family fast fawcett filtering first fourth fransisco frey geoffrey germany group harmoniums hinton hofmann icml inference information international jaakkola jason july kaufmann latent lawrence learning machine machines margin markov marlin matrix maximum methods michael michal mishra mnih model modeling monte morgan multiple multiplicative nathan ncrg neal networks neural nina nips nowlan pages prediction press principal probabilistic proceedings processing profiles radford raedt rank rating references rennie report research restricted retrieval richard rosen ruslan salakhutdinov saul scholkopf science sebastian semantic september sharing simplifying soft sparse srebro stefan systems technical thomas thrun tipping tommi toronto twentieth twenty twentysecond uncertainty university user using washington weight weighted welling with wrobel zemel http://books.nips.cc/papers/files/nips20/NIPS2007_0415.pdf 219 SpAM: Sparse Additive Models additive aggregation aistats anova berkeley bernoulli chapman component consistency data department dimensional elements functional garrote generalized hall high inference journal lasso learn learning linear mach methodological mining model models multivariate noisy nonnegative nonparametric over parametrization persistency prediction predictor proceedings recovery references regression representations royal rwat selection semiparametric series sharp shrinkage smoothing society sparse sparsity springer statist statistical statistics tech thresholds type verlag virtue http://books.nips.cc/papers/files/nips20/NIPS2007_1101.pdf 271 Receding Horizon Differential Dynamic Programming abbeel accuracy advances advantages aerobatic aerosense aerospace algorithms amphibious amphibot andrew annual application applications approach artificial atkeson attached authors automatic automatica automation available based biology biomechanical biped bipedwalking brakes brings center central christopher clawar climbing coates cogsci computational conf conference constitute continuous control controller controls convergence cornell coulom covariance crawls crespi cursor defence determining differential dimensional discrete discretetime discretization dynamic elsevier emanuel engineering extension figure filter flight following from functions garcia generator global gradient green grenoble helicopter high icra ieee ijcnn ijspeert ildp information institut intelligence interaction interactive international iterative itself jacobson joint journal julier kalman keep kuffner largest learning left liao libraries library linear local locomotion machine manuscript matrix mayne medicine method methods middle minimax mode model moore morari morimoto motion motor mouse moves movie munos national nearest neighbor networks neural newton nips nonlinear nose optimal optimization optimizers order over package pages papers parameterized parametric pattern peters planning points policies policy polytechnique practice predictive present prett primitives problems proceedings processing programming projected propels quigley reduced references reinforcement remi report representation research resolution review right robot robotics robots robust schaal second sensing shoemaker show simulation snake snapshot society solutions spaces speed spherized stilman stolle submission suitable swimmer swims symp systems target technical techniques that then theory thesis this three time todorov trajectories trajectory transactions ucsd uhlmann unconstrained under user using value variable vectors walking where with yakowitz zeglin http://books.nips.cc/papers/files/nips20/NIPS2007_0546.pdf 74 Learning Visual Attributes affine associated banks barnard based caltech capturing caspi categorization class classes classification color concept criminisi cvpr dalal dataset datasets detection dictionary efficient entropy felzenszwalb fergus filter from gradients graph histograms html human huttenlocher iccv ijcv image images index invariant jojic lazebnik learned learning local locus maps measure minka multimedia names near necessary object oriented pami perils perona ponce probabilistic promise real recognition references region regions regular representation scale schmid segmentation sparse structure texture triggs tsin universal unsupervised using varma verbeek vision visual visualness weijer winn with world yanai zisserman