http://books.nips.cc/nips21.html
NIPS 2008 PP
http://books.nips.cc/papers/files/nips21/NIPS2008_0309.pdf	213	Learning a Discriminative Hidden Part Model for H u m a n A c t io n R e c o g n it io n	action actions appearance application approach bakir basri behavior belongie berg biologically blank bmvc caputo categories classification collins conditional correspondence cottrell crowded cvpr dalal darpa darrell data deformable demirdjian detection discovering discriminative discriminatively distance distortion dollar efficient efros event features felzenszwalb fields freeman gesture gorelick gradients hebert hidden hierarchical histogram human huttenlocher iccv icml icpr ieee ijcv image images inspired irani iterative january jhuang kanade labeling lafferty laptev learning local location lucas malik matching mcallester mccallum mining model models morency mori multiscale niebles nips nowozin object objects oriented part pereira pets pictorial poggio probabilistic proc quattoni rabaud ramanan random recognition recognizing references registration russell schuldt segmenting sequence serre shape shapes shechtman sivic space sparse spatialtemporal spatio stereo structures subsequence sukthankar system technique temporal their time trained triggs tsuda understanding unsupervised using videos vision visual volumetric wang with wolf words workshop zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_1041.pdf	83	Online Prediction on Large Diameter Graphs	abound advances algorithm algorithmic amer america applications association attributes barzdin belkin blum bound cambridge chawla chemistry cluster conf conference congestion corr data distance doklady doyle editors electric evaluation exploiting fakcharoenphol fields francisco frievald from functions gaussian general ghahramani graph graphs gremban harmonic herbster hoffman icml improved information international irrelevant journal kaufmann kijsirikul kinderman klein labeled labeling lafferty learning linear littlestone machine manifolds markov math mathematical miller mincuts mining mistake morgan networks neural niyogi online over pages parallel pelckmans perceptron performance platt pontil preconditioner predict prediction press proc proceedings processing providence randic random recursive references resistance riemannian routing scholkopf semi snell soviet structure supervised suykens symposium systems their theory threshold unlabeled using wainer walks when with workshop york zagha
http://books.nips.cc/papers/files/nips21/NIPS2008_0168.pdf	42	Learning Bounded Treewidth Bayesian Networks	abbeel abhandlungen algorithm algorithmic algorithms annals approx approximation artificial aspe bach bayesian baysian belief bilmes biology bodlaender bound bounded branch cell cells changes chechetka chickering chow circuit comb complete complexity computational computationl computations conditioning consortium cooper ction dagum darwiche dasgupta data dechter dependence dimension dirac discrete distrib east efficient environmental estimating experiments expression factor finding from gasch genomic glover graph graphical graphs guestrin hamburg hapmap harder heckerman heuristic hoesel ieee ijcai inference info intelligence intelligent international jmlr jordan journal junction karger kaufmann koller koster laguna lauritzen learning local luby marinescu markov math maximum meek meila microsoft minors mixtures model models modern molecular morgan narasimhan nature networks nips optimal path pearl poly polytrees principled probabilistic probabilities problems program project raphical reasoning recursive references report research response rigid robertson royal sample schwarz search seminar seymour society spiegelhalter srebro statistical statistics stats structures symposium systems tabu tech technical than theory thin time trans tree trees treewidth tutorial univ universiteit using utrecht width with
http://books.nips.cc/papers/files/nips21/NIPS2008_1011.pdf	46	Resolution Limits of Sparse Coding in H ig h D im e n s io n s 	aeron akcakaya algorithmic allerton approximate approximation april arxiv atomic baraniuk baron basis berkeley bits bounds california candes capacity chen circuits class coding commun comp competition compressed compression compressive computation computing conditions conf control convex curr decomposition dept dictionaries dimensional distortion donoho eecs efficient elad elec encoding exact field fixed fletcher frequency from good goyal greed high highly identifying ieee incomplete inform information inputs johnson june just lasso lewicki limits linear local lossy madison mallat march matching math measurements meets methods models monticello natarajan natural nature near necessary networks neural neurobiology neuroscience noise noisy observation olshausen optimal overcomplete pages pattern presence press princeton principles proc process programming projections pursuit pursuits random rangan rate rauhut reconstruc recovery redundant reeves references regimes regression relax representations results robust romberg royal rozell saligrama sampling sarvotham saunders schnass selection sensing sensor sensory sept setting shannon sharp shrinkage siam signal signals solutions sounds sparse sparsity stable stat statist statistics strategies sublinear sufficient systems tarokh tech temlyakov theoretic theory thresholding thresholds tibshirani time tion trans tropp uncertainty univ universal using vandergheynst wainwright with workshop zhang zhao
http://books.nips.cc/papers/files/nips21/NIPS2008_0983.pdf	181	Regularized Co-Clustering with Dual Supervision	albright algebra amato among analysis approach approximation axbt banerjee belkin bipartite bottleneck bregman chapelle chung clustering clusters computer criteria cxdt data dhillon ding document documents druck editor editors entropy equation equivalence examples expectation factorization factorizations features framework from gardiner generalized geometric ghosh graph harville huang icdm improvement information initializations jmlr kecman labeled langville laub learning lecture manifold mann mathematical matrix maximum mccallum melville merugu method methods meyer modha moler negative niyogi nonnegative notes orthogonal park partitioning peng perspective press references regularization relationships scholkopf science semi sentiment sigir simon sindhwani slonim software solution spectral springer statistician supervised sylvester theory tishby transactions unbalanced unlabeled using various word words york zien
http://books.nips.cc/papers/files/nips21/NIPS2008_0098.pdf	37	Translated Learning: Transfer Learning across Different Feature Spaces	accuracy active analyzing applicability auxiliary battle blum caruana categorization cikm clustering colt combining comparative computer constructing cross data dietterich distinctive document ecdl effectiveness feature features from ghani icml image improving information informative international invariant journal keypoints knoblock koller koster labeled lafferty language learning lingual literature lowe machine minimization minton mitchell models multi multitask muslea nigam packer pedersen priors query raina references report retrieval risk robust scale selection self semi sigir sources study supervised survey taught technical text training transfer university unlabeled using view villegas vision wisconsinmadison with yang zhai
http://books.nips.cc/papers/files/nips21/NIPS2008_0120.pdf	130	Reducing statistical dependencies in natural signals u s in g r a d ia l G a u s s ia n iz a t io n	actions advances algorithms anal analysis analytical applications april arising asilomar aspects atoms attneave august barbara barlow based bell bethge between black buccigrossi cambridge cartesian cell cells chapman characterization chen cochlear code coding comm communication comp compared component components compression computation computer computers conf conference control cortex courant cover cvpr densities dependence dependencies dietterich distribution distributions dordrecht edge edition editor editors effective efficient eindhoven elements elliptically embedded emergence ensemble entropy estimates estimating experts extraction factorial fang fast feller field fields filter filters first fisher fixed forms framework from function gain gaussian gaussianization gaussians gopinath graphical grassberger grenander grove hall hateren hearing heeger higher higherorder hofmann holland hoyer huang human hyvarinen ieee image images independent information informational inki inst intell international interscience introduction january johannesma joint jordan journal july klamkin kluwer kotz kraskov krieger lausanne learned learning leen lewicki linear lond london mach machine mathematical matthias measuring messages miller mixtures model modeling modelling models motivated muller multiinformation multivariate mumford mutual nash natural nature networks neural neurons neuroscience nips nonlinear normal normalization november nucleus october olshausen order orientation outputs pacific pages parra patten pattern perception phys platt point polar possible power press primary principles priors probability proc processing properties psych radial ramesh receptive recognition references related removing report research response responses restoration robust rosenblith roth sajda santa saobing scale scenes schaaf scholkopf schwartz science sciences scott sejnowski sensory signal signals simoncelli simple society solla some sounds spacings sparse spectra spence spherical srivastava stationarity statistical statistics stimulus stochastic stogbauer striate studeny switzerland symmetric symposium synthesis systems technical theory thomas tool topographic trans transformation tresp underlying universal university used using vejnarova vision visual volume wainwright wavelet wegmann wiley william with workshop york zetzsche
http://books.nips.cc/papers/files/nips21/NIPS2008_0350.pdf	215	Large Margin Taxonomy Embedding with an Application to Document Categorization	advances algorithm algorithmic allocation american analysis annual application applications association automated automatic based blei boyd buckley budanitsky cambridge categorization chapman chapter chen classification collection computing concept conference content convex crammer deerwester defense development dimensionality dirichlet distance document dumais efficient evaluation experimental exploiting explorations fast five furnas hall harshman hersh hickam hidden hierarchical hierarchy hirst hofmann hong implementation implementations indexing information interactive international jordan journal karypis kernel klautau knowledge lafferty landauer large last latent learning leone lexical linguistics london machine machines management margin markov measures metric models mputational multiclass multidimensional naacl neural newsletter north ohsumed optimization oriented other pages pedersen press proceedings processing recognition reduction references report research resources retrieval rifkin saul scale scaling science sebastiani semantic sigir sigkdd singer society solvers speech springer support surveys systems taxonomy technical test text university updated vandenberghe vector verlag very weigend weinberger wiener with wordnet workshop yang york zeng
http://books.nips.cc/papers/files/nips21/NIPS2008_0401.pdf	165	Efficient Exact Inference in Planar Ising Models	academic accelerated accepted actually addition advances algorithmic algorithms almost also alternative analysis applications applying approach appropriate approximate arise arrangements arxiv beineke besides biconnected binary blake blossom boost borgwardt boyer boyermyrvold brown bundle bureau calculating cambridge canadian chapter clearly code component components computation computing conceptual conditional conf consider constraint consulting contain contractible convergence cook cost cover crossings currently cuts cutting cycles database decomposition depth describing developing development dimer dimers directions directory distinct does drawing each edge editor editors edmonds effective efficient either embedding energy exact examples existence experiments explored exponential extended extensions external face fast fields file finds first fisher flowers foundation framework frameworks from frustrated function functions future gatech genus globerson grabcut gradient graph graphical graphs great ground guestrin gutwenger have hofmann http hybrid idea ieee implementation implies include index inference info information informs intelligence interesting intl ising isye jaakkola jgaa journal kamenetsky kasteleyn kernels koller kolmogorov labeling lattice learning less library likewise liotta lncs machine margin markov matching matchings mathematics maximum mechanics method methods microsoft minimized minimizing minimum models more murphy mutzel myrvold national neither networks neural nonplanar nonsmooth nonsubmodular number numerical obtain obvious opens optimization otherwise overpasses pages partial paths pattern perfect phys physica planar planarity plane platt polyhedron possible powerful practical press proc processing proposed proteins prove provide proving qpbo quadratic ramps random reference references replaces report research results review road rohe rother saul schmidt scholkopf schramm schraudolph section segmentation selected siam simplified situations source springer standards state states statistical statistics stochastic structure submodular submodularity systems taskar technical tertiary that theory these this thrun topics topological tractable training trans trees truth using value vault verlag version vertices vishwanathan vision volume wcook weight what where which white whole whose wilson windsor with without works yields york zabih zowe
http://books.nips.cc/papers/files/nips21/NIPS2008_0545.pdf	212	Diffeomorphic Dimensionality Reduction	acoustic advances anal annual applied back becker bilmes borgwardt cambridge candela chapman classification colored comparative computational conf conference constraints cottrell data database davatzikos deformation demers diffeomorphisms dimensional dimensionality dissertation distance doctoral duda dupuis edition elsevier embedding ertl estimated exploration fields flows framework france gaussian generalized geometric global grenander gretton hall handwritten hart helsinki herbrich herik high hinton hull ieee image imaging information intell international intl joshi joystick karacali kaufmann koller landmark langford large latent lawrence learning linear local london maaten mach machine matching mateo mathematics maximum medical miller models morgan multidimensional neighbor neural neurocognition nips nonlinear obermayer pattern platt postma preservation press problems proc process processing quarterly recognition reduction references regularity representer research review roweis saul scaling scholkopf science signal silva similarity singer smola song speech springer stochastic stork structures submitted systems technology tenenbaum text theorem theory through thrun topology toulouse trans transactions unfolding university variable variance variational venna verlag visual visualisation vocal wiley york
http://books.nips.cc/papers/files/nips21/NIPS2008_0864.pdf	65	Supervised Exponential Family Principal Component Analysis via Convex Optimization	advances allerton analysis annals applications belloni berkeley bishop block borgwardt borwein boyd bundle cambridge cecchi closed collins colored commun compo component computing conditions conf conference control convergence convex coordinate dasgupta dept descent dimensionality discriminant duality efficient eigenvalues eugenics exponential factorization families family fisher form gaussian generalization generalized global grabarnilk graphical gretton icml ieee inference information international introduction jolliffe jordan journal kernels kriegel largest latent lawrence learning lewis linear machine math matrices matrix maximum measurements method methods mika minimization minimizing mixture models muller multiple nent networks neural nips nondifferentiable nonlinear optimality optimization orlitsky overton parametric pereira press principal principle probabilistic problems proceedings process processing prog rank ratsch reduction references relaxations report research rish royal sajama schapire scholkopf schuurmans semi sigkdd signal smola society song springer statistical statistics sums supervised symmetric systems taxonomic technical theory tipping training tresp tseng uction unfolding using vandenberghe variable variance variational verlag wainwright weston with womersley workshop
http://books.nips.cc/papers/files/nips21/NIPS2008_0135.pdf	106	An ideal observer model of infant object perception	about account acquisition adelson analysis baillargeon bayesian behavior boundaries breinlinger british carey causal child clarendon cognition cognitive coherence cohesiveness collisions combination computer connectionist continuity count current david debate development developmental devos directed discrete does early editors ehrlich entities events evidence fenner further groups grzywacz hofsten human huntley ideas individuals individuate inert inertia infancy infant infants influence information initial innate interaction international involving jacobson james johnson journal katz kersten kestenbaum kinetic knowledge kotovsky laura learning local macomber mareschal mathematical memo models month motion multidisciplinary needham neurobiology object objects occlusion opinion origins oxford pages perceive perceived perception permanence persistence perspectives physical premack press principle principles psychological psychology purcell reaching reasoning references renee report representations review revisited rigidity schweinle science signals slow small smooth solimando spatial speed spelke sperber stuff suggestions technical termine theory threemonth unity vision weiss wilcox young yuille
http://books.nips.cc/papers/files/nips21/NIPS2008_0873.pdf	99	Inferring rankings under constrained sensing	advances aggregation algebra algorithmic artificial bayati betting birkhoff candes chen commerce conference convergence correctness david decoding diaconis distributions duality dwork edmonds efficiency efficient electronic eleventh evdokia flow fortnow group guestrin guibas howard huang ieee improvements inference information intelligence international jebara jour karp kondor kumar lance lecture lineal linear march matching maximum monograph multi naor network neural nikolova nips notes object observaciones pages pennock permutations probability problems proceedings processing product programming rank references representations revisited series shah sharma sivakumar sobre statistics symmetric systems theoretical theory tracking transactions tres tucuman univ weight with yiling york
http://books.nips.cc/papers/files/nips21/NIPS2008_0644.pdf	227	Learning with Consistency between Inductive Functions and Kernels	acad academic advances alex american analysis applications arsenin automatic belkin bernhard bulletin cambridge carpentry colt computational cucker debnath diego diffusion edition estimating evgeniou examples features foundations framework from functions generalized geometric gmikhail graduation hastie herbrich hilbert hong institute introduction john journal kernel kernels kwong labeled lafferty laplacian learning least lebanon leung lippert loader local lokenath machine machines manifold manifolds massachusetts mathematical mathematics mikusinski nadaraya networks nips niyogi notes partha piotr poggio pontil posed predefined press probability problem problems proc ralf references regression regularization regularized report representer research riemmannian rifkin rosenberg sankhya scholkopf schonberg science second series sindhwani smale smola smooth society solutions space spaces spline squares statistical support technical technology theorem theory tikhonov university unlabeled vector vikas watson wenye winston with
http://books.nips.cc/papers/files/nips21/NIPS2008_0438.pdf	23	Efficient Inference in Phylogenetic InDel Trees	acid algorithm algorithms alignment alignments american amino analysis ancestor applicable approach arbitrary associates association balibase based batzoglou bayesian benchmark binary bioinformatics biol bouchard brudno bruno carlo chain change clustal common comp consistency construction cornell cote data database dendrograms diaconis distance doss efficient emnlp evaluation evol evolution evolutionary extant felsenstein forms galtier gene general genome gouy graphical griffiths halpern hein higgins holmes improved inching inference inferring john joining kishino klein language liang life likelihood lunter mahabhashyam markov maximum method methods microcomputer miklos model monte moret multiple neal needleman neighbor newton nonhyperthermophilic package pearl performance performing phylogenetic phylogenies phylogeny plewniak poch probabilistic probcons programs proteins quartet rannala reality reconstruction references report research reversible sampler science search sequence sequences sharp similarities sinauer socci song statistical statistics study technical thompson thorne tourasse toward tree trees university unweighted using vawter warnow weighted wunsch yang
http://books.nips.cc/papers/files/nips21/NIPS2008_0746.pdf	91	Spectral Clustering with Perturbed Data	above academic advances algorithm analysis annals anomaly approach approximate approximating asuncion axis bars based bayesian belkin belongie bits bottou bound bounds bousquet brandt breast cancer choose chung circle clustering clusterings clusters colt computer concentric consistency cormode corresponding cuts data decentralized department derived detection digits distributed drineas error experiments failures fast features figure fowlkes from function galun garofalakis gaussian gelfand good gram grouping guang handwritten html http huang identification ieee image improved information intelligence iris jordan joseph journal kannan kernel kushnir large learning luxburg machine mahoney malik manifold matrix method methods mlearn mlrepository more multiscale munagala network networks neural newman nguyen nips nonparametric normalized number nystr obtained pattern perturbation press proceedings processing quantization query range rate recognition references replications repository respectively sample scale science segmentation sensor sets shows signal silberstein simulated size sketching spectral statistics statlog stewart streams suppression systems taft test than them theory through tracking tradeoffs transactions upper using value values vempala vetta vldb wainwright waveform weiss wine wisconsin with yang
http://books.nips.cc/papers/files/nips21/NIPS2008_0790.pdf	229	Deep Learning with Kernel Regularization for Visual Recognition	advances american analysis ando applications applied approach automatic bags baluja based battle bayesian bengio beyond boosting bosch bottou boureau bower boyd categories challenge chapelle classification cluster collobert compact components computer conf conference conferenece control cortex cvpr data deep dimensionality distance document embedding euclidean examples face fazel feature features fergus flynn framework from generative gesture goldberger gradient grand greedy haffner hankel heuristic hierarchies hindi hinton huang icml identification ieee image incremental information inspired international invariant journal july kernel kernels lamblin larochelle layer lazebnik learning lecun localized lowe machine machines matching matrices matrix method minimization models multiclass multiple munoz mutch natural neighbourhood networks neural nips nystrom object packer performance perona philips poggio ponce popovici predictive preliminary press proceedings processing pyramid raina rank ranzato ratle recgonition recognition recognizing reducing references representations research results rois roweis rowley salakhutdinov scene schmid scholkopf science scruggs seeger self semi serre sparse spatial speed structures submitted supervised systems szummer tasks taught tested training transfer unlabeled unsupervised using vision vison visual weston williams wise with wolf worek workshop zhang zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0662.pdf	27	A spatially varying two-sample recombinant coalescent, with applications to HIV escape response	affect aids allele analysis ancestral antisense antisensemediated applications attenuated balding based bayesian binder biology biometrika black blackburn blue carlo cell chain chen classes clinical coalescent computation consequences constraint containing data december deeks denham determination developing disequilibrium diversifying does doms dropulic effect enfuvirtide entry estimate estimating evolution figure from functional fusion gaps gene genealogies genetics graph green greenwell griffiths harrison hein hotspots hudson human identifying immunodeficiency incapable inhibition inhibitor inhibitors intervals intragenic journal jump kingman line lines linkage marjoram markov martin matthews mcguire mcvean mean mediated model modeling models molecular monte mutants neutral nucleotide other oxford pages peptide phylogenetic polymorphism population posterior potent presence press primer processes progress properties rates recombination references replication research resistance results retroviruses reversible rossi schierup selection sequence sequences severely single slepushkina springer stephens stochastic susceptibility synthetic their theoretical theory therapy traditional type university using variation vector verlag virology virus virxsys wild wilson with wiuf
http://books.nips.cc/papers/files/nips21/NIPS2008_0280.pdf	119	Sparse Online Learning via Truncated Gradient	advances alexis algorithms andrew ascent asuncion ball based batle benchmark bianchi bounds bradski budget case categorization cesa chandra coding collection computation convex dekel descent dimensions duchi efficient elastic estimated exponentiated fast fixed forgetron functions generalized gradient high honglak http hunch icml ieee implementation infinitesimal information irvine journal june kernel kivinen langford large lars lasso learning lewis linear long loss machine matlab multicore networks neural newman nips olukotun online onto pages pegasos perceptron prediction predictors primal problems proceedings processing programming projections pubdb quadratic raina rajat reduce references regression repository research rose royal scale schwartz selection shalev shrinkage shwartz singer society solver solving sparse spca srebro statistical stochastic strand strehl systems text tibshirani transactions using version versus vowpal wabbit warmuth worst yang zhang zinkevich
http://books.nips.cc/papers/files/nips21/NIPS2008_0875.pdf	140	Gates	algorithm algorithms allerton anal approximate approximations archambeau artificial bayesian between bishop botstein boutilier buntine case clustering collins communication computing conference context contingent control diagrams distribution expectation extended factor factors field frey friedman gates geman genetics gibbs goldszmidt graph graphical graphs ieee images independence inference infinite intell intelligence jair jmlr junction koller kolobov kschischang labeled lander learning linkage loeliger machine mapping maps march marthi mcallester mean mendelian message microsoft milch minka mixture mjolsness modeling modelling models networks neural neurocomputing notation notations operations pages passing pattern pereira probabilistic proc propagation quantitative references relaxation report research restoration rflp robust russell sontag specific statistics stochastic structured svensen technical theory traits trans tree uncertainty underlying using variational verleysen wiberg wiegerinck winn with workshop
http://books.nips.cc/papers/files/nips21/NIPS2008_0903.pdf	147	Joint support recovery under high-dimensional scaling: Benefits and perils of 1,-regularization	absolute algorithms american annals approximation approximations april atomic basis benefits berkeley blockwise buldygin candes characterization chen classification composite computing constrained counting covariate dantzig decomposition department dimension dimensional donoho estimation faces gilbert grouped hierarchical high image issue joint jordan journal kozachenko larger lasso lowers mathematical metric model much negahban noisy november obozinski penalties perils polytopes processes processing programs projected projection providence pursuit quadratic radically random randomly recovery references regression regularization report rocha royal saunders scaling selection selector series sharp shrinkage siam signal simultaneous sinica society sparse sparsity special stanford statistica statistical statistics strauss submitted support tanner taskar technical technometrics than thresholds through tibshirani tropp turlach under university using variable variables venables wainwright when wright zhao
http://books.nips.cc/papers/files/nips21/NIPS2008_0458.pdf	50	Characteristic Kernels on Groups and Semigroups	abstract advances amari analysis appear application bach berg berkeley bondhus borgwardt california chang christensen classifiers colt component conditional conformal consistency course cuturi data dependence dependent dept dimension dimensional dimensionality embeddings fitting folland fourier fukumizu functions geometric gretton groups hanna harmonic hewitt hilbert histories improve independence independent influence injective interpretations interscience jmlr jordan journal kernel kernels kinematics lanckriet learning lett machine machines malvig measures method multivariate neural nips operators optimal pettersen press probability problem proc process prosthesis rasch reduction references regression report reproducing ressel robotica ross rotation rotational rudin scholkopf semigroup semigroups smola smooth song space spaces springer sriperumbudur statistical statistics stavdahl steinwart supervised support tech test transformation twosample university vector vert with
http://books.nips.cc/papers/files/nips21/NIPS2008_0626.pdf	124	Designing neurophysiology experiments to optimally constrain receptive field models along parametric submanifolds.	accepted ahrens brain chap cognitive computation computational connor cugell decharms decoding depireux design edin elsevier encoding enroth foldiak function gazzaniga gollisch insights into journal lewi linden machens models network neural neurocomputing neuron neurophysiol neurophysiology neuroscience neurosciences optimal paninski physiology press references science simoncelli statistical stimulus systems theoretical theunissen third woolley
http://books.nips.cc/papers/files/nips21/NIPS2008_0500.pdf	175	On the Reliability of Clustering Stability in the Large Sample Regime - Supplementary Material	advanced american annals applications association asymptotic banerjee betwen billingsley bounded bregman cambridge central clustering convergence dhillon divergences dudley empirical fields ghosh grimmet hoeffding inequalities journal june learning limit machine mathematical mathematics measures merugu oxford press probability processes random references related relations research springer statistical statistics stirzaker studies sums theorems theory tops uniform uniformity university vaart variables weak wellner with
http://books.nips.cc/papers/files/nips21/NIPS2008_0175.pdf	69	Self-organization using synaptic plasticity	abbott activity adaptation advances appl avalanches beggs bertschinger biophys cambridge canada causing cell chaos circuits competitive complex computation computations copelli criticality cultured december dependence dependent developing dynamical dynamics edge editors emergent ensemble ensembles event excitable feedback fire firing focusing geisel gerstein gomez guez hebbian herrmann hippocampal homeostatic hysteresis ijcnn induced information integrate interchange journal kaltenbrunner kelso kinouchi langton learning legenstein levina lopez mandelbrot mandell math message miller modeling models modifications natschlager nature nelson neocortical nervous network networks neural neuron neuronal neurons neuroscience noisy nonlinear optimal organized packard pages patterns period phase phenomena physica physics plasticity plenz populations postsynaptic press processing random range real recurrent references reviews rodr science scientific self shlesinger siam singapore single song spike spiking springer stochastic strength suarez sustained synapses synaptic system systems through time timing toward transition transitions turrigiano type vancouver vreeswijk walk works world
http://books.nips.cc/papers/files/nips21/NIPS2008_0693.pdf	75	Learning Hybrid Models for Image Annotation with Partially Labeled Data	alexander allocation altun andrew annotated annotation antonio appearance arora aspect based bear belkin best bike bill bishop black blei bottom building carreira carsten categories categorization chris christopher class classification color combining conditional context contextual corel crfs criminisi cues cuts cvpr dale data database datasets david debajyoti dependency dependent detection dirichlet discriminative down eccv efficient eric face fence feng fernando field fields figure forsyth framework freeman from gang generative grass greiner grimson ground hebert himanshu hippo hoon horse hybrids iccv icml icpr ieee image images incorporating interaction jakob jamie jiao john joint jordan julia kelm kumar labeled labeling labelling labelme lafferty lasserre latent learn learned learning lepard localization loeff mach malik margin markov martial maximum mcallester mcauliffe mccallum memo methods michael miguel mikhail minka model modeling models msrc multi multiscale murphy nicolas nips normalized object orig pages pami panel partially pereira performance perpinan pixel plane polar principled probabilistic random recognition references region regions report results rhino richard rother russell sanjiv scene schuurmans segmentation segmenting semi sequence shaojun shape shotton snow some sorokin spatial structured supervised technical textonboost thomas tigher tool topic torralba trans tree triggs truth unsupervised using variables vegetaion verbeek void wang water winn with wolf xiaogang xuming yasemin zemel zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0889.pdf	182	Unlabeled data: Now it helps, now it doesn't	active advances analyses analysis annals annual artificial assumption asymptotic balcan berlin bernoulli beyond bickel blum bounds case castelli castro chapelle chicago classification cluster colt complex complexity computer conference constant convergence cover data datasets david density department does edinburgh error estimation estimators exponential faster finite from generalization heidelberg help html http ieee image information institute intelligence international introduction inverse journal kaariainen korostelev labeled lafferty learning lecture letters local loss machine madison manifold manifolds minimax model networks neural nips niyogi nonparametric norm notesmonograph nowak nussbaum optimal papers papersps parametrique pattern people polynomial problems processing provably rates recognition reconstruction references regression regularization relative report research rigollet sample samples science seeger semi separation series singh some springer ssminimax statistical statistics stone style supervised systems technical tenth theoretical theory tomography transactions tsybakov uchicago under university unknown unlabeled using value volume wasserman willett wisc wisconsin with workshop worst zien
http://books.nips.cc/papers/files/nips21/NIPS2008_0153.pdf	125	Dimensionality Reduction for Data in Multiple Feature Representations	adaboost analysis approach bach bartlett based bayesian berg bosch boyd canu categories category chang chen class classification correspondences cortex cristianini cvpr darrell dept dimensionality discriminant discriminative distance distinctive distortion efficiency efficient embedding ensemble examples extensions features fergus ferns fisher forests framework from frome functions general generative ghaoui grandvalet graph grauman hastie iccv icml ijcv image incremental inspired invariance invariant jmlr jordan kernel kernels keypoints lanckriet large learning local locality localized lowe magnani maire malik match matching matrix michigan mika model models more muller multi multiclass multiple munoz mutch nearest neighbor networks neural nips niyogi object optimal pami perona poggio power preserving processing programming projections pyramid rakotomamonjy random ratsch recognition reduction references report retrieval review rosset scale schafer scholkopf selection semidefinite serre sets shape siam signal singer sonnenburg sparse statistics technical tested trade training university using vandenberghe variants varma vision visual weston with wolf workshop yang zhang zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0369.pdf	44	MDPs with Non-Deterministic Policies	academic alternatives applications approach artificial athena background bailey barosi barto based benelearn bertsekas bias cambridge care chapter clin clinical concalves control data deciding decision decisions depression disease dynamic ernst estimation fava fraser function handbook hauskrecht health heart icml informatics intelligence international intervene introduction ischemic journal kearns kluwer learning machine magni management mannor marchetti markov medical medicine near north observable operations optimal partially planning poly press proceedings process processes programming psychiatr publishers quaglini rationale references reinforcement relieve research roberts rush schaefer science scientific sequenced shechter simester singh stan star strategies study sutton time treatment trivedi tsitsiklis using value variance wehenkel when with
http://books.nips.cc/papers/files/nips21/NIPS2008_0583.pdf	196	The Recurrent Temporal Restricted Boltzmann Machine	advances algorithm analysis anderson application applications approach approximations architectures artificial back belief bell bengio bergstra berkeley binary blind boltzmann bounds class complex computation conference contrastive courville data deconvolution deep dependencies dept descent difficult dimensional dimensionality directed distributed divergence eleventh empirical erhan errors evaluation experts exploring exponential factors families family fast field fields frasconi freeman function generalizations gradient graphical harmoniums hidden hierarchy high hinton hochreiter human icml ieee image inference information inspeech intelligence international jaakkola jordan larochelle latent learning likelihood long machine machines many markov maximization mean memory millennium minimizing modeling models motion multilevel murray nature nets networks neural osindero pages partition patches peterson problems proceeding proceedings processing products propagating propagation quantitative rabiner random recognition reducing references report representations restricted retrieval rosen roweis rumelhart salakhutdinov schmidhuber science sejnowski selected separation sequences short simard statistics sutskever systems taylor technical term theory tieleman training transactions tutorial understanding upper using variables variation variational volume wainwright weiss welling williams willsky with yedidia
http://books.nips.cc/papers/files/nips21/NIPS2008_0855.pdf	236	Kernel Measures of Independence for non-iid Data	aaronson algorithm altun american analysis applications bach based bedo besag biological blind borgwardt borovkova bousquet burton clifford clustering colored colt component conditional conf consistency convex correlated cybernetics dehling dependence dimension discussion divergence efficient embeddings estimating estimation exponential families fast feature fields finite fukumizu functionals gilat graphs gretton hammersley herbrich hilbert hill hofmann hosseni icann icml ieee independence independent influence injective interaction intl jegelka jmlr jordan jutten kernel lanckriet lattice lattices laws learning letters likelihood limit machine machines manuscript markov mathematical maximization maximum measures measuring methods minimization mixing mixtures muller nguyen nips nonlinear penalized probability proc processes processing random ratio references risk scholkopf selection separability separation shen signal smola society song sources space spatial spectral sriperumbudur stat statistical statistics steinwart strong structure submitted supervised support systems tdsep tech temporally test theorems time transactions unfolding unpublished using variance vector view wainwright weiss with ziehe
http://books.nips.cc/papers/files/nips21/NIPS2008_0767.pdf	238	Learning the Semantic Correlation: An Alternative Way to Gain from Unlabeled Text	aistats allocation analysis ando annals another battle blei blum bootstrap chapelle chawla classification constructing data dirichlet documents efron elements features framework friedman from graph hastie hofmann icml incorporating inference informative into jackknife jmlr joachims jordan keerthi knowledge koller krupka labeled large latent learning linear look machine machines mccallum methods mincuts mining mitchell multiple nigam pages prediction predictive press prior priors probabilistic raina references scale scholkopf self semantic semi sigir sindhwani springer statistical statistics structures supervised support svms tasks taught text thrun tibshirani tishby transductive transfer unlabeled using vector york zhang zien
http://books.nips.cc/papers/files/nips21/NIPS2008_0997.pdf	155	Improving on Expectation Propagation	accurate advances also analysis approach approximate approximation approximations assessing asymptotic attempt attias attractive bayesian bethe between binary bounds cambridge classification consistent convergence corrections decide develop divergence energy expansions expect expectation finite framework function gaussian given graphical have help higher hilbert inference information interpolate janson journal kuss learning loop machine measures message method methods microsoft minimization minka models more neural opper order other pages passing possible power press problem process processing propagation radius rasmussen references report research scaling schemes series similar spaces such sudderth systems technical terms that these they this university user variational wainwright which will willsky winther
http://books.nips.cc/papers/files/nips21/NIPS2008_0016.pdf	225	Spike Feature Extraction Using Informative Samples	acad advances ahmed analysys appear bragin buzsaki chae chen component comput conf donoghue driscoll embs ieee irwin isscc jolliffe kemere lewicki methods nadasdy natl neural neurosci nips papers penttonen principal proc quian quiroga references rehabil santhanam shaul shenoy springer syst tech trans vargas verlag yang york zumsteg
http://books.nips.cc/papers/files/nips21/NIPS2008_0895.pdf	95	Psychiatry: insights into depression through normative decision-making models	abnorm account action acute adolesc alter american analysis analytic anhedonic antipsychotic approach associated association attention attentiondeficit avoidance axis based bayesian becker behavior behavioral bellini bentall berardi between bias biobehav biol biological biometrics bortolotti brain braver care causal challenges characterization child chronic clin clinical cognition cognitive cohen comparisons comput computational conditioned control controllability controlled cortex cortical corticotropin cowen current davidson dayan decisions decreased deficits depletion depressed depression depressive derubeis detection developments diagnostic difference discussion disorder disorders doherty dolan dopamine dorsal edition editor editors emotion evaluation events evidence experimental exploratory factor fails first following formulation four framework friston gatsby gelfand general gibbon glowacki gotlib guilford hammen handbook hebbian helplessness henriques hosp humans huys hyperactivity impairment impulsivity inhibition institute interaction interrupt interventions interview jahn john journal kapur karkowski kendler learned learning life lond london maier major manual mechanisms medications mega menchetti mental mesencephalic meta mild model montague montaguti mood morris moutoussis nature negative network neural neuromodulation neuron neuropsychol neuropsychological neuropsychopharm neurosci neuroscience norepinephrine nucleus objective onset outpatients oxford paperback patient personal peterson phasic phenotype philos pizzagalli plos power practice predictive prefrontal preliminary prescott press primary profile psychiatric psychiatry psychol psychological psychology psychopharm psychopharmacol randomized raphe recent references reilly reinforcers relapse relationship releasing relevance reliability remington research response responsiveness review reward roles routledge schizophrenia scid science sejnowski seligman serotonin severely seymour shea signal simons smith sons spitzer state statistical stress stressful stressor structured substrates systems tang temporal theory therapy thesis tiology toward towards trans treatment trials tryptophan uncertainty under unexpected unit university utility validity veiel version versus watkins wiley williams willner with year york
http://books.nips.cc/papers/files/nips21/NIPS2008_0099.pdf	52	Tracking Changing Stimuli in Continuous Attractor Neural Networks	abbott acad amari appl berry biological blumenfeld brivanlou brody bulthoff cambridge chow computation computational coombes current cybernetics dayan deneve ermentrout giese graf hahnloser heeger hopfield jastorff jordon kepecs kourtzi latham mathematical mcnaughton meister modelling natl nature neural neurobiology neuron neurophysiology neurosci neuroscience neurosicence opinion phys physics pouget preminger press proc progress psychology references renart reports romo sagi samsonovich scholkopf seung shen siam sompolinsky song systems theoretical tsodyks vision wang wichmann yishai zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0090.pdf	2	Mixed Membership Stochastic Blockmodels	allocation american analysis approaches artificial association based batagelj bayesian blei blockstructures brief case categories change clustering computer concepts conference cornell directions dirichlet discussion donnelly doreian estimation experimental ferligoj genetics ghahramani graphical griffiths handcock hierarchical hoff human ieee infinite intelligence introduction issues jaakkola jordan journal kemp latent learning lecture machine mapping methods model models national natural network networks notes novitiate nowicki pattern period perona populations prediction pritchard proc raftery recent recognition references relational relationships research review robins rosenberg royal sampson saul scene science series snijders social society some space springer statistical steinley stephens stochastic structured study systems tantrum tenenbaum thesis ueda university variational verlag vision wasserman with yamada
http://books.nips.cc/papers/files/nips21/NIPS2008_0954.pdf	158	The Infinite Hierarchical Factor Regression Model	activities activity advances agglomerative alignment american analysis applications approach association bayesian beal binary bioinformatics buffet carlo carvalho chain chang clustering coalescent coalescents components computation concentrations data daume determination dimensional dyadic expression factor factors falciani feature gene genetic genomics ghahramani green griffiths hidden high independent indian inference infinite information james journal jump kingman knowles large latent lawrence linear local lucas markov meeds model modeling modelling models monte neal networks neural nevins nonparametric oxford paradigm pournara press probabilistic process processes processing profiles rangel rattray reconstructing references regression regulation regulatory reversible roweis sabatti sanguinetti small sollich sparse specific statistical statistics stochastic systems their transcription university verbeek vlassis volume wang wernisch west wild with
http://books.nips.cc/papers/files/nips21/NIPS2008_0197.pdf	132	Deflation Methods for Sparse PCA	advances algorithms anal analysis appl application applications applied approximations aspremont assignment automat avidan bach based basic bounds brain cadima case cell chatoor choice cognition complement component components computation computational conference constraints contr correlations december deflation depace department direct discrete dordrecht eigen eigenvalues eigenvectors error exact factors feedback finding formulation fowlkes full generalized ghahramani ghaoui graphical greedy hastie hendriks henriquez huang icml ieee industrial information international interpretation iterations jeffers jolliffe jordan journal kernen kluwer lanckriet lasso learning like linear loadings luengo machine mathematics matrix meaningful methods modified moghaddam music musically neural newton nips normalization partial path penalized pole principal proc proceedings processing programming projection rank rbel references regularization report rotation saad schur semidefinite siam simirenko simon society sparse spectral springer sriperumbudur stanford state statistics studies systems technical technique tibshirani torres trans uddin university using vancouver verlag weber weiss white with words workshop york zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0994.pdf	179	This is the pre-proceedings version of this paper. It may differ from the version that will eventually appear in the proceedings of NIPS 2008.	about abstraction abstractions accelerating actions advances algorithm amarel amherst artificial automated automatic barto based between betweenness brandes celebration centrality chentanez clarification clustering collections computer computing conceptual conference decomposition density developmental dietterich discovery diverse dynamic edinburgh eighteenth european fagg faster first framework freeman function goals grace graph hierarchical hopper hoze identify identifying information intelligence international intrinsically journal klein learning lecture local machine macro mannor massachusetts master mathematical maxq mcgill mcgovern mdps measures menache motivated networks neural notes novelty options pages partitioning precup press problems proceedings processing reasoning references reinforcement relative representations research roles science second semi shimkin simsek singh skills social sociology sociometry stolle subgoals sutton systems temporal thesis third thirteenth twenty university upon useful using value with wolfe women
http://books.nips.cc/papers/files/nips21/NIPS2008_1020.pdf	58	An Efficient Sequential Monte Carlo Algorithm for Coalescent Clustering	above adaptive advances agglomerative albanian almost also although applications applied approach armenian baltic bayesian bengali between biology breton bulgarian capture carlo catalan celtic chen clustering coalescent coalescents college computational concave contribution convex cornish czech danish data daume defining department diffusion dilan dirichlet distributions donnelly dutch english essays evolution evolutionary fearnhead felsenstein figure filter french from gaelic gatsby genealogy genetics german germanic gibbs gilks gorur greek griffiths hierarchical hindi icelandic indic infered inference infinitesimal information iranian irish italian journal kashmiri kingman kurdish languages large latvian likelihood lithuanian maithili marathi maximum mcmc means merton method methods mixture modelling molecular monte neal nepali neural neuroscience normalized norwegian note ossetic oxford panjabi particles pashto persian polish population populations portuguese priors probability processes processing references rejection report resampling rest romance romanian royal russian sample samples sampling science seem sequences sequential serbian similarities simulating sinhala slavic slovene society spanish statistical statistics stephens stochastic stopping structure swedish systems tajik tavare technical that their theoretical theory thesis time toronto tree trees ukrainian unit university using values volume wals weight weights welsh which whye wild williams with without
http://books.nips.cc/papers/files/nips21/NIPS2008_0446.pdf	105	Extracting State Transition Dynamics from Multiple Spike Trains with Correlated Poisson HMM	abeles acad advances aertsen algorithms amari approximate artificial attias bayesian beal becker bergman berry bialek biol college communications comp computation computing conference cybern danoczy dulfer fontanini fukuda haalman hahnloser inference intelligence jones kano katz kawamura kruger london margoliash meilijson meligkotsidou miller minami nakahara nakamura nature network neural neurocomputing nips nishikawa okanoya phys preparation proc prut radons references sadacca schneidman science segev seidemann slovin statistics systems tanifuji thesis thishby tishby uchida ueda uncertainty university vaadia variational watanabe yamazaki
http://books.nips.cc/papers/files/nips21/NIPS2008_0681.pdf	67	A "Shape Aware" Model for semi-supervised Learning of Objects and its Context	allocation analysis annotation author authors automatic based blei categories categorization class classification coherent coling collections combined concurrent cone contour corpora crandall cream cvpr cycles database dictionaries dirichlet disambiguation discover documents drawings eccv efros elidan extent fergus finding freeman from google griffiths grimson grouping heitz hierarchical hofmann huttenlocher iccv ieee ijcv image images implicit integrating invariant jordan journal koller labelme large latent learning leibe leonardis lesk machine marchine model models multiple murphy nips object objects part parts perona pine pnas probabilistic readable recognition references research roget rosen russell scale scenes schiele scientific search segmentation segmentations segmentationwith semantic sense shape sigdoc sivic smyth song spatial spatially statistical steyvers sudderth supervised syntax tell tenenbaum their tool topic topics torralba trained unsupervised untangling using vision visual wang weakly wilsky word workshop yarowsky zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0367.pdf	77	Shape-Based Object Localization for Descriptive Classification	accurate active alphabet anguelov animation appearance approach async automatic available based bayesian belief berg blake bmvc boosted cambridge cartoons categories cipolla class classification completion contextual contour cootes corresp correspondence curved cvpr davis deformable descriptive detection detectors discriminative distinctive distortion eccv edwards efficient elidan examples fast features felzenszwalb fergus ferrari fields fitzgibbon framework freeman from gaheitz generative heitz hertz hier hierarchical hill hillel holub http huttenlocher iccv identification ijcv image images incremental informed intelligent invariant jurie kaufmann keypoints koller landmark learning learnt level localization loops lowe malik marching matching mcgraw message methods model modeling models morgan murphy natural nips object opelt packer passing pearl people perona pictorial pinz prasad probabilistic propagation random reasoning recognition reconstruction references relational report research residual rigid rodgers scale scape scene scheduling schmid schwartz sethian shape shapes shotton siggraph single srinivasan stanford structures surfaces systems taylor technical tested thrun torralba training unsupervised using view visual weinshall with zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0270.pdf	123	Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method	accelerated advances alexander algorithms analysis andrew approximate artificial bernhard body cambridge carlo chapman charles classification compressed computational computations computing conference data david december decomposition deng density dietterich dimension dimensions dongryeol drineas dual dustin edition editor editors efficient eigenspace estimation exact experiment fast faster fisher fourteenth francisco freitas gauss gaussian geometry golub gray greengard hall high holmes hopkins ieee independent information intelligence international isbell jasa johns joint journal kannan kaufmann kernel koller krylov lang lawrence learning leen locally machine mahdaviani mahoney marshall martin martinsson maryam matrices matrix meeting merging method methods michael mining models monte moore morgan multipole multivariate nando neural nonparametric olkopf pages pattern peter platt polynomial predictions press problems proceedings processing ralph references regression rokhlin roweis saul schneider scholkopf scientific sebastian second siam silverman singer splitting statistical statistics strain submitted summation summations systems theory third thomas thrun ting todd toward tractability transactions transform transforms tree tresp twenty ultrafast uncertainty university very vladimir volker wang weighted weiss yang
http://books.nips.cc/papers/files/nips21/NIPS2008_0373.pdf	117	Scalable Algorithms for String Kernels with Inexact Matching	academy adaptive advances alex alphabets analysis andre approach baldi based bernhard bibm biocomputing bioinformatics biology cambridge cheng chris christina class classification classifiers cluster codes comparative computation computational content cristianini david dengyong detecting detection diekhans ding discriminative distantly dubchak efficient eisenberg eleazar elisseeff eskin eugene extraction fast fold framework freund gapped genomic genre gribskov gunnar haussler homologies homology huang iain icml icpr inexact information inna interscience jaakkola jason jianlin john journal juho june kernel kernels kuang kuksa large learn learning leslie local mach machine machines mahira mark matching mclachlan melvin methods mismatch mitsunori motif multi multiclass music national nello networks neural nips noble ogihara pacific pages pattern pavel pavlovic pierre press proceedings processing profile protein proteins ratsch recognition references related remote retrieval role rousu sample scale scholkopf sciences semi september sequence sequences shawe siddiqi sigir smola sonnenburg soren sparse spatial spectrum stafford statistical string study substring supervised support symposium systems taylor theory tommi tree university using vapnik vector vishwanathan vladimir volume wang weston wiley william with yoav york zhou
http://books.nips.cc/papers/files/nips21/NIPS2008_0434.pdf	144	Relative Performance Guarantees for Approximate Inference in Latent Dirichlet Allocation	academic airoldi algorithm allocation american amherst analysis andrzejewski approximation artificial arxiv aspect aspects auai author authors based bayesian beyond bioinformatics biology blei blockmodels books breitling buntine campbell categories cdna chains chemudugunta collaborative collapsed collections communities complexities component computational computer conference corrada croft data debugging decomposition deerwester dennis digital dirichlet discover discovering discovery discrete distributed document documents dumais dynamic editors efros email emmanuel enron erlbaum european expectation experiments extent faceted feature fienberg filtering freeman from furnas gaussian general generative ghahramani giles girolami graphical griffiths harshman hierarchical hofmann ieee image indexing inference information intelligence international introduction jaakkola jakulin joint jordan journal kaban kintsch kurihara lafferty landauer latent laurence learning liblit libraries library machine manavoglu markov marlin massachusetts master mccallum mcnamara meaning membership methods microarray mimno minka mixed mixture mixtures model modeling modelling models mulhern multiple natural networks newman nips objects organizing pages pattern perona perspective press probabilistic proceedings process profiles propagation recipient recognition references report research retrieval road rogers role rosen russell saul scene science segmentations selection semantic sets sigir simplicial sivic smith smyth social society specific springer statistical steyvers stochastic structure subjects subspace technical their thesis topic toronto transactions uncertainty university user using variational vision wallach wang watanabe welling with words xing zhou zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0740.pdf	160	Adaptive Template Matching with Shift-Invariant Semi-NMF	abstract acoustic adaptive aerospace among anteroventral arkadiusz array benesty berkeley berlin cambridge carney chapman characteristic chen clustering cochlear coding complex computation convex data dictionnaries dimension ding distributions electronic enhancement factorization fang frequency gaussian germany hall hansen huang icassp icdm identification ieee image invariant jordan joris journal kameoka kashino kotz laboratory lawrence lbnl learning london machine madsen mallat matching matrix meeting methods microphone midwinter mlsp multivariate music national negative neural neurophysiol nonnegative nucleus oeztuerk press proc process processes processing pursuit random rangaswamy rasmussen references related relationships representation research responses revisited sagayama sayles schmidt semi shift shifted signal signals smith sparse spherically spike springer submitted symmetric synchronization systems tech time tones trans using various vector verlag waveforms weiner williams winter with zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0984.pdf	10	Sparse probabilistic projections	absolute adaptive advances algorithm america american analysis analyzers applications approximate archambeau aspremont association attacks bach backprop barndorff barrington bayesian becker berkeley bishop brain brown buhmann calibration california canonical caron ches cognition component components computational computer conference convex correlation credit crism cryptographic department dependent dietterich direct distribution distributions domany doucet editor editors embedded eprints expectation factor faul finding florida formulation gaussian generalized ghahramani ghaoui goubin graphical griffin hardoon hardware hastie hemmen hinton hyperbolic icml incremental information international interpretation inverse jordan journal justifies kaski klami lanckriet lasso lassos learning lecture levy likelihood local machine mackay management matsui maximization meaningful methods mixtures models moments multivariate music musically neal negative networks neural nielsen nips nonconcave nonparametric normal notes omnipress optimization oracle other pages pascal peeters penalization penalized portfolio press principal probabilistic processes processing programming properties quisquater references regression report review rgensen risk royal scaling scandinavian schulten science selection semidefinite shawe shrinkage siam sigg society sparse springer sriperumbudur standaert state states statistical statistics stelzer subspaces systems taylor technical template that thesis tibshirani tipping toronto torres turnbull united university using variable variants verlag view volume warwick wenbo with words workshop
http://books.nips.cc/papers/files/nips21/NIPS2008_0518.pdf	157	Global Ranking Using Continuous Conditional Random Fields	algorithm algorithms analysis annual application approach based belkin benchmark beyond bipartite bousquet chen cited clickthrough clustering cohen computations conditional conf consistency continuous corporation cumulated cuts data dataset dhillon distillation document documents editors engines estimation evaluation examples feedback feng fields framework from gain gaussian geometric getoor ghahramani gibbs global golub graph hopkins icml ieee image independent information intelligence introduction jarvelin joachims johns journal kekalainen king kwok labeled lafferty learn learning letor lewis listwise loan local mach machine malik management manifold math matrices matrix mccallum measure methods metrics microsoft mixture models neural niyogi normalized objects optimizing ordinal pages pairwise partitioning pattern poole press probability processes processing propagation pseudo random rank ranking references regression regularization regularized relational relevance reordering report research retrieval robust scholkopf search segmentation sigir similarity sindhwani site softw sparse spectral statistical stockmeyer study subtopic sutton syst systems taskar technical techniques theory titles topic trans transactions tsai university unlabeled using wang weston with words workshop xiong zhai zhang zhou
http://books.nips.cc/papers/files/nips21/NIPS2008_0431.pdf	63	Offline Handwriting Recognition with Multidimensional Recurrent Neural Networks	abed advances algorithms amiri analysis applications applied approach arabic architectures artificial baldi based bengio bidirectional bottou bridle brown bunke cambridge cifed classification colloque competition comprehensive computation computer conference connectionist cortex dagrnns data database design document ecrit editors ellouze enit feedforward fernandez fogleman francophone gers gomez gradient graves haffner hammamet handwriting handwritten herault hierarchical hochreiter icdar icml ieee independent information intelligence international interpretation jaeger journal koller labelling large learn learning lecun line liwicki long lstm mach machine maddouri manke margner memory models mrgner multidimensional nature network networks neural neurocomputing neuroscience ninth november npen object online outputs pages paliwal pattern pechwitz pittsburgh plamondon platt poggio pollastri porto portugal precise prediction press principled probabilistic problem proceedings processing protein recognition recognizer recurrent recursive references reichert reisenhuber relationships research roweis scale schmidhuber schraudolph schuster september sequence short signal singer society soulie springer srihari statistical structure supervised survey systems temporal term thesis timing transactions tunis unconstrained unsegmented using verlag waibel washington with words writer
http://books.nips.cc/papers/files/nips21/NIPS2008_0882.pdf	232	Multi-Agent Filtering with Infinitely Nested Beliefs	aaai about acting agent agents amir artificial behavior beliefs bernstein both bounded brandenburger cassandra clean common conf conference decentralized decisions dekel domains doshi dynamic economic fagin first follows framework games gmytrasiewicz halpern hand hansen hierarchies ijcai immediately implies improved induction infer intelligence intelligences international iteration joint journal kaelbling knowledge koller larger least littman logic memory milch modal models moses muddy multi must national observable only other others partially pattern planning policy pomdps press probabilistic probability proc programming raise raises reasoning references research round sequential settings seuken shirazi stochastic that their theory there they this time uncertainty vardi verified will zilberstein
http://books.nips.cc/papers/files/nips21/NIPS2008_0729.pdf	193	An Online Algorithm for Maximizing Submodular Functions	aaai adam adaptive advice algorithm algorithmica algorithms alon amos analysis andreas anna approach approximating approximation approximations armed artificial attribute auer awerbuch azar babu bandit bandits bart baruch bernardo bianchi budgeted cald carla carlos carnegie cesa cohen combining computational computing conf constraint costs cover coverage daniel data database david diverse economics edith efficient eiter expert eyal feige fiat filip filters fisher freund function functions games golovin gomes graphical guestrin haim hard haussler helmbold heuristics hogg huberman icml information intelligence intl itaru jennifer joachims joseph journal kakade kalai kamesh kaplan katrina khuller kleinberg knapsack krause kushilevitz laszlo learning letters ligett lovasz lukose management manfred mansour mathematical matthew maxim maximization maximizing maximum mellon models moss motwani multi multiarmed multiple munagala naor near nemhauser nicolo nishizawa noga nonmyopic nonstochastic note online operations optimal ordering pages peter pipelined playing portfolios prasad problem problems proc proceedings processing programming radlinski rajan rajeev rankings references report research robert samir schapire science seffi selman sequences sham shivnath siam smith soda stephen stoc stream streeter subject submodular sviridenko technical tetali theory thomas thorsten threshold trials university uriel value warmuth widom with wolsey yishay yoav yossi
http://books.nips.cc/papers/files/nips21/NIPS2008_0730.pdf	153	Multi-resolution Exploration in Continuous Spaces	advances agents algorithm analysis application approximate approximation artificial auer autonomous barto based batch bounds brafman cambridge carnegie computational computer conference control convergence decision discrete discretization dissertation doctoral dynamic ernst estimation exploration function general geometry geurts gordon icml information intelligence international interval introduction iteration joint jong journal kaelbling kakade kearns lagoudakis langford learning least linear littman logarithmic machine maching markov mellon metric mode model moore multiagent munos near nearoptimal neural nips online optimal ortner parr pittsburgh policy polynomial preparata press proc proceedings processes processing programming puterman rates references regression regret reinforcement research resolution schemes school science seventeenth shamos singh sixth solutions spaces springer squares state stochastic stone strehl survey sutton systems tennenholtz theoretical time tree undiscounted university variable wehenkel wiley york
http://books.nips.cc/papers/files/nips21/NIPS2008_0171.pdf	14	Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning	absolute algorithm algorithms analysis annals appear bach based battle bennett boosting boyd camb cambridge canu classifiers coding composite conic consistency convex cristianini darrell density distribution duality effect efficiency efficient embrechts features function generalized grandvalet grauman group grouped heterogeneous hierarchical icml ieee input jordan kernel kernels lanckriet lasso learn learning mach mark match methods micchelli model models momma more multiple networks neural nips optimization pattern penalties pontil press proc pyramid raina rakotomamonjy references regularization report rocha roth scholkopf seeger selection sets shawe sigkdd smola sparse statistics taylor technical through trans univ vandenberghe williams with zhao
http://books.nips.cc/papers/files/nips21/NIPS2008_0129.pdf	101	Multi-label Multiple Kernel Learning	agarwal american analysis annotation application applications approximate automated bartlett basic belongie beyond bioinformatics biology branson canonical chung classification clustering computation controlled convex correlation correspondences course cristianini darrell descriptors determination dimensions drosophila during embedding embryogenesis evaluation expression functions gene genome ghaoui graph graphs grauman hardoon hettich high higher huang hypergraphs icml ieee infinite instance intelligence introductory jordan journal july kernel kernels kortanek kumar label lanckriet large learning lectures local machine machines mathematical matrix methods mikolajczyk minimization multi multiple nesterov neural nips optimization order overview pages pattern patterns performance press programming ratsch references regularization research review scale scene schafer schmid scholkopf semi semidefinite shawe siam smola smooth society sonnenburg spectral springer support systematic szedmak taylor theory tomancak transactions using vector vocabulary with zhang zhou
http://books.nips.cc/papers/files/nips21/NIPS2008_0041.pdf	239	Cyclizing Clusters via Zeta Function of a Graph	acknowledged advances ahmed algebraic algorithm also analysis anatomical appreciated arxiv bagrow between bianconi bollt cambridge cerebral classification cluster clustering coding combining comments community compression computational computations computing cond connection connectivity continuing contreras cortex cortical costa cuts cycles darve data derksen destexhe discussion dueck edelman eigenvectors ensembles entries feng find finding framework free frey function functional ghosh gibbs graph graphs grateful greatly hamilton help hong http ieee image information insightful intelligence interesting inverse john jordan journal kind klimeck knowledge learning loops lossy machine malik marsili math matrices matrix measures mechanics messages mixed multiple multivariate network networks neural neuroanatomy neuronal newman normalized partitions passing pattern physical physics points press processing random recognition references relating research reuse review reviewers role russ savchenko scale science segmentation sergey short size sparse spectral sporns states statistical stochastic strehl structure suggestions surv systems thank their theoretical theory tononi trans using weiss with wright xiaodi yaokun zeta
http://books.nips.cc/papers/files/nips21/NIPS2008_0319.pdf	25	Syntactic Topic Models	accurate acquired advances allocation american analysis annotated artificial association automatically based bayesian beal blei bottou boyd building cambridge categories collaborative collins computational computer conference constituent construction conversion convex corpus croft cvpr czech definition dennis dependency development dirichlet disambiguation document driven edinburgh emperical english erlbaum experts extended features filtering finding finkel ghahramani graber graphical grenager griffiths gruber head hidden hierarchical hinton ieee improving infinite information integrating intelligence international into introduction jaakkola johansson jordan journal juan kintsch klein koeling landauer language lapata large latent laurence learning liang linguistics machine manning marcinkiewicz marcus markov marlin mccarthy mcnamara meaning methods model modeling models natural networks neural ninth nodalida nugues optimization pado pages parsing pcfg penn perona petrov prague predominant press probabilistic proceedings processes processing products profiles puerto putop rating references republic research retrieval rico road rosen santorini saul scene scholkopf scotland semantic semeval sense senses sigir similarity society space statistical statistics steyvers sussx syntax systems text theoretic thrun topic topics tree treebank turning university unlexicalized untagged user using vandenberghe variational volume washington weeds weiss word
http://books.nips.cc/papers/files/nips21/NIPS2008_0637.pdf	109	MCBoost: Multiple Classifier Boosting for Perceptual Co-clustering of Images and Visual Features	advances algorithm algorithms analysis baker bartlett baxter boosting bsat clustering computation computer conf dalal data database descent detection dhillon discovery experts expression face features floatboost frean freeman gradient gradients hierarchical histograms human ieee illumination information instance intelligence jacobs jones jordan knowledge learnability learning machine mallela mason mining mixture modha multiclass multiple multiview murphy neural object oriented pages pattern platt pose proc processing real recognition references robust schapire sharing sigkdd statistical strength systems theoretic time torralba trans triggs viola vision visual weak zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0125.pdf	241	Recursive Segmentation and Recognition Templates for 2D Parsing	advances algorithm algorithms allwein analysis annual appearance application approach aspect association auto based binary bottom boundary boykov building carlo carreira chain chen class classification classifiers collins combine computation computational computer conditional conference context crfs criminisi cuts data detection discriminative document down driven empirical estimation european experiments features field fields framework free freeman from generation generative gist global grammars grammatical graph head hebert hidden hierarchical high ieee image images inference information initial inside intelligence interactive international jelinek joint jolly journal klein koller kumar labeled labeling lafferty languag language lari learned learning level levin liang linear linguistics machine manning margin markov mccallum meeting methods model modeling models monte multi multiclass multiscale natural neural novel object objects oliva optimal outside parsing partially parts pattern pennsylvania perceptron pereira perpinan probabilistic probability proceedings processing random rapid recognition reducing references region research role rother scene scenes schapire segmentation segmenting sequence shape shilman shotton singer society speech statistical stochastic structure substring sudderth systems taskar tasks textonboost theory thesis torralba training transactions triggs unified unifying university using verbeek viola vision weiss willsky winn with young yuille zemel zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0300.pdf	234	Posterior Consistency of the Silverman g -prior in Bayesian Model Choice	american amsterdam analysis approach approaches aspects assessing association averaging bayarri bayes bayesian benchmark berger bernardo bruno clyde curve data dawid decision discussion distributions econometrics editors essays factor factors fernandez finetti fitting george goel heckerman holland honor inference journal kass kohn large liang mcculloch mixtures model models molina nonparametric north observational oxford pages paradigm parametric paulo philadelphia press prior priors raftery references regression royal selection siam silverman sinica small smith smoothing society some spline statistica statistical statistics steel techniques university using variable wahba west with zellner
http://books.nips.cc/papers/files/nips21/NIPS2008_0739.pdf	17	Transfer Learning by Distribution Matching for Targeted Advertising	adaptation advances application bayes bias bickel bogojeska borgwardt bruckner bunau carin classification conference correcting covariate data differing direct dirichlet discovery discriminative distributions estimation evgeniou function gaussian gretton hierarchical huang importance improving inference information international journal kashima kawanabe keerthi kernels knowledge krishnapuram large learning lengauer liao likelihood logistic machine method mining model multi nakajima neural newton pages planning pontil predictive priors proceedings process processing references region regression regularized research sample scale scheffer scholkopf schwaighofer screening selection shift shimodaira smola statistical sugiyama systems task test therapy training tresp trust under unlabeled weighting weng with
http://books.nips.cc/papers/files/nips21/NIPS2008_0824.pdf	81	Fast Prediction on a Tree	abernethy advances adversarial algorithm algorithms annual appl application approximating argyriou artifical aspects based bayesian belkin betweenness biemann bipartite blum boyd brandes cambridge castillo centrality challenge chapelle chemistry chinese clustering colt combining computer computing conference content cormen current davison denoyer distance dooren drineas ecml effective efficient fields fleischer flow functions gallinari gaussian ghahramani ghosh gram graph graphs harmonic haymond herbster hyperlinks icml identification improved information integer intelligence international introduction inverse jarvis jebara kernel klein labelling lafferty language laplacian laplacians large learn learning leiserson lett linear mach machine machines mahoney math mathematical matrix matveeva measure measures method mincuts minimizing minimum moderate naacl natural nearly networks neural newman niyogi nystrom online over page pages partitioning perceptron pontil prediction press problems proc proceedings processing pseudo randic random randomized reddy references regularization resistance retrieval review rivest rwebangira saberi science section seeger semi shier siam softw solving spam spanning sparsification speed spielman supervised symposium systems techniques teng textgraphs theoretical theory through time trans tree trees uncertainty using wainer walks webspam weights whispers williams with workshop
http://books.nips.cc/papers/files/nips21/NIPS2008_0094.pdf	231	Variational Mixture of Gaussian Process Experts	adaptive advances alternative approach artificial aspects bartlett based bayesian bishop bounds cambridge classification computation csato curve department engineering experts fast fitting forward gaussian ghahramani greedy hierarchical hinton infinite information inputs intelligence jacobs jordan keerthi lawrence learning line local machine matching meeds mixture mixtures model models networks neural nowlan opper optimizing osindero parametric press proc process processes processing pseudo pursuit rasmussen references regression royal search seeger selection silverman smola smoothing snelson society some sparse speed spline stat statistics svensen systems theis tresp ueda uncertainty university using variational waterhouse williams workshop
http://books.nips.cc/papers/files/nips21/NIPS2008_0179.pdf	151	Robust Kernel Principal Component Analysis	acoustics active adaptive advances algorithm algorithms alzate analysis anandan approximate artificial bailly baker bakir benelux berar beyond bishop black british cambridge carnegie cohn component computation computer conference contemporary control cristianini cybernetics data database deng desvignes dimensional eigenvalue estimation european expression face feature fields find flow framework function gaussian generative gong gross high huber ieee illumination image images information international iterative jolliffe jordan journal kanade kearns kernel kernels kwok latent lawrence learning loss machine machines mapping mathematics matthews meeting mellon methods mika missing mller model models motions muller multi multiple networks neural noising nonlinear note optimization pang parametric pattern payan piecewise polynomial pose press principal probabilistic problem proceedings process processing psarrou ratsch recognition reconstruction references regularization report robust romaniuk romdhani roweis royal sanguinetti saul scholkopf scholz shape shawe shen signal smola smooth society solla spaces spca speech springer statistical subspace sudijanto support svensen systems syukens taylor technical thrun tipping topographic torre transactions tsang uisng understanding university using variable vector verlag view vision visualization wang weston williams with york yuan zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0163.pdf	33	Linear Classification and Selective Sampling Under Low Noise Conditions	about accurate active advances aggregation agnostic algorithm algorithms analysis angluin annals appear applications atlas azoury bachrach balcan bartlett based beygelzimer bianchi blanchard bounds bousquet braun broder burges cambridge campbell case castro cesa classification classifiers cohn colt committee competitive component computer conconi connectionist convexity corpus cristianini cvpr dasgupta density distributions editors eigenspectrum eigenvalues error estimation exponential family fast freund games gaussian general generalization gentile gilad gram http icml ieee improving inen information international jasa jmlr joachims jordan kalai kandola kaufmann kernel kernels koller ladner langford large learning line linear lkopf loss lugosi machine machines made making margin matrix mcauliffe methods minimax monteleoni morgan navot networks nips nowak online optimal pages perceptron practical prediction press principal probabilistic properties queries query rates real references regularized relative researchandstandards reuters review revisited risk sampling scale scovel selective seung shamir shawe smola society springer statistical statistics steinwart support taylor text theory threshold tishby tong training trans transactions tsybakov university using vector vovk warmuth williams with worst ying zaniboni zhang zhou zwald
http://books.nips.cc/papers/files/nips21/NIPS2008_0964.pdf	34	Privacy-preserving logistic regression	accuracy agrawal analysis anonymity anonymization approach asuncion barak beyond blum boyd breaches bugliesi calibrating chaudhuri computer conference consistency contingency convex crypto cryptography data database datasets dependence design differential disciplined disclosing diversity dwork editor editors enforcement evfimievski fast feige focs foundations gehrke generalization grant holistic http icalp icde icml ieee information interactive international inverse johnson kale kanonymity kasiviswanathan kifer ladner large learn learning lecture ligett limiting machanavajjhala machine matlab mcsherry mechanism mining mishra narayanan neural newman nissim noise notes objectives optimization page pages pods preneel preserves preserving privacy private privately proc processing programming protecting random raskhodnikova rates references regularized release repository research robust roth samarati sampling sassone schwartz science security sensitivity shalev shmatikov shwartz sigmod size smith smooth society software solution sparse springer srebro sridharan srikant stanford stoc suppression sweeney symposium systems table talwar theory through training venkitasubramaniam volume wegener what when
http://books.nips.cc/papers/files/nips21/NIPS2008_0312.pdf	48	Nonparametric Bayesian Learning of Switching L in e a r D y n a m ic a l S y s t e m s	above aerosp after algorithm allows also although amer anal analysis analytically analyze aoki appendix approximate assignment assignments assoc assume auxiliary backward backwards balch based bayesian beal blei both calculate caron carvalho chain changing common comp computation compute computed computing condition conditional conditionally conditioning conf consider constant constructive continuous counts covariance data davy decompose define defined definition definitions dellaert denotes densities dependency derive derived dirichlet discrete distributed distribution distributions doucet duflos dynamic each easily econ electron equivalent etnk exact explore expressed fact feasible filter first following follows forecasting form forward forwards from function fusion gamma gaussian general generating ghahramani gibbs given global harrison have havenner hidden hierarchical human hyperparameters icml identities ieee ijcv increment indexes inference inferring infinite information initial initialize initialized integrate inverse ishwaran jilkov joint jointly jordan july kalman known learning likelihood linear lopes maccormick maneuvering marginalization marginalizing markov matrix mean measurement message messages methods mixtures mode model modeling models more motion multiple multivariate murphy nips noise normal normalization normally notation note numerically observation observations over parameter parameters parametric part passed passing patterns pavlovic persistence place placing plus posterior predict previous prior priors probabilities probayility procedure process processes product pseudo quadratics rasmussen recursion recursively references rehg remains representations rong rule running sample sampled sampler samples sampling scheme segmental sequence sequential sequentially series sethuraman sharing show similar simple simulation since sinica slds some space specific specifically springer stable standard starting stat state statistics still stochastic structure sudderth sufficient summarized survey switching syst systems target targets term that then these this thus time tracking trans transition transitions update used useful using value vanheeghe variables vector volatility west where which willsky wish wishart with working write xuan zarepour
http://books.nips.cc/papers/files/nips21/NIPS2008_0971.pdf	205	Bounding Performance Loss in Approximate MDP Homomorphisms	aaai abstraction actions approximate approximations artificial arun barto based bisimilarities bisimulation bounding castro choosing communication comput computer computing concurrency conference dean decision discrete dynamic engineering equivalence exact ferns fifth finding finite formal fourth framework gibbs givan greig hall hertfordshire homomorphisms icml ieee induced infinite intelligence international knowledge kumar larsen littman markov mathematics mdps methods metrics milner minimization model munkres notions operations options panangaden precup prentice probabilistic probability proceedings processes programming programs puterman ravindran references relations relativized research reusable right sefm similarity skou society software spaces state stochastic symposium systems testing theory through topology towards transformation tree unified walsh washington whitt wiley with wolfe
http://books.nips.cc/papers/files/nips21/NIPS2008_0198.pdf	136	Domain Adaptation with Multiple Sources	adaptation adaptive aleix anal analysis approach association audio bacchiani benesty biographies blenders blitzer bollywood boom bounds boxes brian chains chengxiang chin class classification computational computer conll continuous crammer czech data david della density discriminant domain domains dredze editors entropy estimation expression faces fernando frederick from frustratingly ganchev gaussian gauvain graca handbook hard hidden huang ieee imprecisely instance intell interscience jacob jean jelinek jennifer jiang jing joao john kearns koby kulesza kuzman language learnable learning legetter leslie likelihood linear linguistics localized mach mark markov mart maximum mercer methods michael michiel minimum mixture modeling models mohan morristown multiple multivariate naacl natural nips novel observations occluded pages parsing partially pattern pcfg pereira phil pietra posteriori prague pratha pratim press proceedings processing quality recognition recognizing references regression representations republic roark roni rosenfeld roukos sample sentiment shai single sondhi sources speaker speech springer statistical supervised talukdar theory trans transactions unsupervised using valiant vapnik variable variant vladimir weighting wiley woodland workshop wortman yiteng york zhai
http://books.nips.cc/papers/files/nips21/NIPS2008_0786.pdf	177	Kernel-ARMA for Hand Tracking and Brain-Machine Interfacing During 3D Motor Control	abeles activities activity aertsen analysis arma based bayesian behavioral bergman bienenstock black branner brockwell cambridge camps caplan chen coding computation control cortex cortical crammer decoding devices direct donoghue drezet dynamics embedding ensemble events febuary feeding figueirasvidal filter filtering forecasting friehsand from haalman hall hand harrison helms hochberg hoffman human identification ieee inner interactions jenkins kakei kalman kass kernel kernels learning luis lvarez machines mart model monkey motor movement movements mukand muscle nature navia neural neuronal neurophysiol neuroprosthetic nips nonlinear olivas online pages particle penn perel population predicting prentice press primary product prosthetic prut rates recursive references relation representations river rojas rojo saddle saleh schoelkopf schwartz science self series serruya shpigelman signals singer slovin smola soria spaces spalding spike spikernels strick support system taylor temporal tetraplegia tillery time tracking trans ukacc upper using vaadia valls vector velliste volume whitford with zquez
http://books.nips.cc/papers/files/nips21/NIPS2008_0038.pdf	39	Load and Attentional Bayes	account acoustical advances america analysis annu appl architecture around aspects attending attention attentional baldwin bayesian bias binding bobrow bottleneck bottou brain broadbent cambridge capacity century chelazzi cherry cogn cognitive cohen communication comprehension compression computational confused considerations contextual contrasting control cortex cosyne cues data dayan decision desimone determinant deutsch distracted distractors dover driven driver duncan early ears editors effect effects england entirely eriksen experience experimental experiments extrastriate failures field focal fockert forster from gates guided human icann identification ignore independent inference information interference irrelevant itti james journal koch koller lavie lens letter letters lewicki limited limits listening load locus mackay major mechanisms memory model modelling models modulation moran mozer multiple navalpakkam network neural neurosci noise nonsearch norman olshausen optimal oxford pages palmer part paschler past percept perception perceptual platt precueing press principles probabilistic processes processing psychol psychology psychophys psychophysics quarterly recognition references research resolves resource review reynolds role roweis sahani saul scholkopf science search selection selective sensory sequential shaw simple simultaneous singer size society some sources speech statistical stimuli stimulus strategies strategy systems target task tasks theoretical theory treisman trends tsal under understanding vision visual volume wald weiss whiteley wiley with within york zemel zhaoping zoom
http://books.nips.cc/papers/files/nips21/NIPS2008_0004.pdf	30	An interior-p oint sto chastic approximation metho d and an L1-regularized delta rule	adaptive advances algebra annals annotation approximation atomic automatic barrier based basis bayesian berkeley bottou bousquet boyd california cambridge categorization ceas chen clark computational computer computing conditioning conf conference constrained constraints control convex cormack corpus creation cristion database debugging decision decomposition discretetime donoho elements error estimated european evaluation fast fiacco filter forsgren free freeman friedman function functions fung genkin gill gorinevsky gradient hastie hessian hill ieee image inequality information interior intl john journal kushner labelme large lasso learning least lewis line linear logarithmic logistic lustig lynam machine madigan math mathematical mccormick mcgraw measurements method methods minimization mitchell model monro murphy networks neural nocedal noise nonlinear numerical online optimization pegasos penalty perturbation perturbations point poljak presence press primal proc proceedings processing programming properties pursuit references regression regularization regularized review robbins rosales royal russell saad saunders scale schmidt scientific selected selection sequential shalev shrinkage shwartz siam signal simultaneous singer society software solver some sons spall spam springer squares srebro statistical stats stochastic supervised systems techniques technometrics text thesis tibshirani tool topics torralba tradeoffs trans transactions trec trefethen unconstrained university using vandenberghe verlag vision wang wiley with wright zheng
http://books.nips.cc/papers/files/nips21/NIPS2008_0447.pdf	162	Optimization on a Budget: A Reinforcement Learning Approach	aaai acquisition adjustment algorithm algorithms american applied approach argyros association barto beardsley bmvc boolean boosting boyan buhlmann bundle camera certain classification combinatorial computation computer conference congress constrained cootes cornelis cristinacce denmark detection dorigo eccv efficient environment estimation evaluation evolutionary extended feature francisco from functions gambardella global gool hand held iaai iccv icml ieee ijcv image implementing interior international iteration jones journal kaufmann koch lagoudakis large learning least levenberg linear local loss lourakis machine marquardt math mathematics matlab method methods miagkikh model modeling models moll moore morgan most nielsen nonlinear object optimization parameters parr perkins point policy pollefeys press problem problems proceedings programs publishers quarterly real references regression reinforcement report research robust salesman satisfiability scale search selection sequences seventeenth siam software solution solving squares statistical subproblem technical time tops torr tracking traveling uctp unconstrained under university using verbiest vergauwen viola vision visual with zhang zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0253.pdf	103	Optimal Response Initiation: Why Recent Experience Matters	account acta actions activity aloud alternative analysis anterior articulatory banburismus basal baum behavior between bogacz brain braver brown changing cherian choice cingulate cogn cognition cohen colliculus colombo coltheart comparison composition computation computational conflict context control cortex criterion damian data deadlines decision decisions decoding diffusion dorfman duration effects elementary errors experimental forced formal frequency from function ganglia glanzer glass gold gurney holmes hypothesis ieee implement investigation jones journal kello kiger laboratory lang learning lexical list lupker macaque making mckoon memory model models moehlis multi naming neural neuro neuron neuronal neurophys nystrom optimal over performance physics plaut predictions preliminary procedure processing production psych psychology rabbitt rastle ratcliff rate reading recognition references relationship response reward routes segraves sensory sentence sequence sequential serial shadlen single some speech speeded stimuli strategic superior task tasks taxonomy taylor testing theory time trans veeravalli verification vyas word
http://books.nips.cc/papers/files/nips21/NIPS2008_0978.pdf	71	An improved estimator of Variance Explained in the presence of noise	account accounting acknowledgments addresses adjusting allowing almost another applying appropriate attributed because benefit benucci best between bias bonin borst both capable carandini cases choose christian classical closer compared condition conditioning conditions confirmed constraints correction cumming curves data david decreasing derived describing deteriorate differ dilemma discussions disparity does each especially estimate estimates estimator estimators experimenter explained extrapolation factor find fits free from furthermore gabor gallant gaussian good greater greatly have helpful higher illustrating importance important imposed improved improvement improves increasing invariant large level levels limited linden macaque machens mante model models more most much nauhaus network neuron neuronal neurons neurophysiol neurosci nips noise noisy note number numerical order other overfitting parameters parker perform performs pointon population precisely present previous previously prince provides quaia quickly realistic references rely repeats repetitions resolution respect results ringach sahani same sampling signal simulation simulations skewed stephen stimulus strongly testing than thank that their theunissen they this three tradeoff traditional tuning unaccounted uncertainty valuable variability variance very ways wehr when where while will with work zador zero
http://books.nips.cc/papers/files/nips21/NIPS2008_0058.pdf	138	Robust Near-Isometric Matching via Structured Learning of Graphical Models	affine altun approach barbosa based belief belongie bmvc body bottou bulow caetano california caltech canny carmichael category cbaivl cheng class computational configurations context contexts convex corner cvpr cyclic data dataset deformable descriptors detection detectors eccv edge efficient enable estimating features felzenszwalb finder from frome generic graph griffin hebert hierarchical hofmann holub huang huber human huttenlocher iccv icml ijcv institute interdependent interest invariance invariant joachims kolluri learning lecun lighting local lowe machine malik matching mcauley methods mikolajczyk minimization modular mori object objects output pami pattern perona pictorial point pose propagation puzicha range recognition recognizing references regional regularized report retrieval rigidity risk scalable scale schmid schwartz shape shapes similar smith smola solver spaces structured structures support technical technology tsochantaridis using vector vishwanathan wiry with
http://books.nips.cc/papers/files/nips21/NIPS2008_0365.pdf	219	Short-Term Depression in VLSI Stochastic Synapse	abbott acad adaptive advances algorithm amit analog andreou annunziato applications applied array artificial asymmetric badoni bangkok based between biophysics bistable bofill cambridge cauwenberghs cells chance characteristics chicca circuits code computation connelly control cortical cryptography curr dependent depends depressing depression devices dietterich diorio douglas driven dynamic dynamics electron eurasip filter fire firing fortune fusi gain generator ghahramani goldberg goldman hafliger hasler hebbian ieee implementation indiveri information integr integrate journal july koch learning mahowald maldonado manor markram mead minch modifying motor murray nadim natl nelson neocortical network networks neural neurobiol neuron neurons neurosci neurotransmitter noise normalizing number opin oxford petrie plasticity postsynaptic power press probabilistic probability proc process processing pyramidal random reconfigurable reduction redundancy references release response role rose salamon science senn short signal silicon simulation single spike spiking stochastic sustained symp synapse synapses synaptic syst systems temporal temporally term thailand theory thompson timing trans transistor trends tsodyks university varela vlsi weighting with york zucker
http://books.nips.cc/papers/files/nips21/NIPS2008_0142.pdf	87	Dynamic Visual Attention: Searching for coding length increments	adaptation advances analysis areas attention attentional attentive attracts balasubramanian baldi ballard based baxter bayesian bell berry beyond bottom bruce carrasco cell center circuitry cluttered code codes coding cognitive components computation computational computer conference cortex cortical cvpr dahlen dependent desimone detection discriminant distributed early edge edgington effects efficient emergence enables energy experimental extraclassical feature field filters foundations functional geisler golden hateren human hypothesis ieee image images impairs incorporating increases independent influences information inhibition intelligence interpretation into itti journal kimber klein klempen koch learning levy ling machine mahadevan maunsell maximization metabolically model modeling modulation motion movement multiple najemnik natural nature neural neurobiol neuron neurons neuroscience neurosciences niebur objects olshausen optimal pages pasternak pattern perception performance perona peters poggio post predicting predictive proceedings processing properties psychology rapid real receptive recognition references representations research return reviews reynolds rutishauser saliency scene scenes sciences search sejnowski selective sensitivity shifts silence simple society some sparse spatial strategies surprise surround sustained systems task towards tracking transactions transmission trends treue tsotsos ullman underlying understanding underwater vasconcelos video vision visual wainwright walther when wolfe world
http://books.nips.cc/papers/files/nips21/NIPS2008_0257.pdf	142	Automatic online tuning for fast Gaussian summation	algorithm algorithms analysis applications approximate arya atlas automated body briers british chapman cluster clustering columbia comput computation computational computer computing conference data davis density design dimensions distance dongarra doucet dual duraiswami efficient empirical estimation experiment faloutsos fast faster feder fftw fixed freitas frigo gauss gaussian gaussians gonzalez gray greene greengard gumerov hall high iccv icml ieee implementation improved inexact inter johnson join jones journal kernel klaas krylov lang laws learning machine machines mahdaviani maskell maximum methods million minimize mining moore mount nearest neighbor netanyahu nips nonparametric number october optimal optimization pages parallel particle particles petitet power press problems proceedings processes project queries rasmussen raykar references regression report science scientific searching seeger selectivity siam sigmod silverman simoncini smoothing soda software spatial stat statistical statistics stoc strain subspace summation sums szyld technical temple testing theoretical theory toward tractability traina transform transforms tree university using vancouver wand wang whaley williams yang
http://books.nips.cc/papers/files/nips21/NIPS2008_0487.pdf	186	Convergence and Rate of Convergence of A Manifold-Based Dimension Reduction Algorithm	academic academy accepted acoustics algebra algorithm alignment analysis appear applications april arts available belkin book boston brand chapter charting computation computing conference data demo dimension dimensional dimensionality donoho downloadable eigenmaps electric embedding enterprise framework gatech geometric georgia global grimes hessian high html http ieee index information institute international invited isye journal labs langford laplacian learning linear local locally mani manifold manifoldbased manifolds march math matlab matrices matrix methods mining mitsubishi model national neural niyogi nonlinear papers performance perturbation press principal proceedings processing properties reduction references report representation research results review roweis saul science sciences scientific selection siam signal silva smith space spectral speech springer statistics stewart survey systems tangent technical techniques technology tenenbaum theory thesis volume wittman york zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0109.pdf	54	The Infinite Factorial Hidden Markov Model	accuracy acknowledge acknowledgments acoustic adapt advances algorithms also although amari american analogous analysis annual another application applications approach artificial association balance bayesian beal beam between blind breaking buffet build call called cemgil century complete component components computational computer computing conference construction control crucial david degree department derivation deserves discussing dynamic effort entropy error explicitly exploration extension extensions extra face factor factorial feature features fhmm finally finely flexibility found further gael generalized ghahramani good gorur griffiths helsinki hidden hmms hyvarinen ieee ifhmm independent indian inference infinite information intelligence interesting international introduced issue joint jordan journal jurgen kindly knowles labeling lack latent learning lecture like linguistics logan machine markov maximum meeting method methods mibp microsoft mixture model modeling models more moreno multi multiple neal networks neural nonparametric notes open paper parameter particular presented presenting probability problem proceedings process processing provides rabiner rasmussen recognition recursive references representation research saatci sampling scheme scholarship science scott selected separation sequences series seventh showed situations society sollich source sparse speech square statistical statistics stick stochastic straightforward structured student success suggestions supported switching systems taylan that this time tracking transition tutorial used variational version view vision wang wealth whether which while with workshop workshops would zoubin
http://books.nips.cc/papers/files/nips21/NIPS2008_0989.pdf	187	Clusters and Coarse Partitions in LP Relaxations	above achieve advances algorithm algorithms allow also although anal analogously appear approach approximate approximations assignment belief berkeley between block bounded bounds cases changing chose cluster clusters coarsened comput computational consider considerably consistency constraints constructing convergent coordinate cost cuts dept derivation descent determinant deza differences different discrete doing each early edge efficient empirical energy enforces equal equality equivalent exact exclusion exponential extension families faster felzenszwalb fields finally find fixing follow following free freeman from full general generalized geometry given globerson graphical hierarchies higher however huttenlocher icml ieee inclusion increasingly inequalities inference information inside intell interact interesting jaakkola jmlr jordan june keeping kohli kolmogorov label larger laurent laws like linear loads look looks lower mach made many mapping marginal marginals markov maximization maximizations meltzer message messages methods metrics minimization minimum models most mrfs multi neural objective optimality optimization order other outer partial partition passing pattern perhaps polytope powers practice presented press probability processing product programming propagation quantity random reduced references relaxation relaxations relevant report represent respect resulting results reweighted rother section setting shekhovtsov signal sontag springe statistics step studied study such sure systems take technical terms than that theory they this tight tightening torr tractable trans transactions tree updates using usual variables variational verlag vision wainwright weiss well were which while with within work writing yanover yedidia
http://books.nips.cc/papers/files/nips21/NIPS2008_0775.pdf	135	Supervised Dictionary Learning	aharon algorithm analysis angle appear applications applied aviyente bach based basis battle bengio bishop blei bottou bruckstein caam categorization chopra class classes classification coding compact compressed compressive continuation criminisi cvpr data deep denoising designing dictionaries dictionary discriminative distant document donoho efficient efron elad embedding employed energy face field fixed framework from ganesh generative gradient haasdonk haffner hale hastie hinton holub huang hybrid hybrids iccv icml icpr ieee image johnstone kernels keysers lasserre learned learning least lecun linear local machines mairal mcauliffe mccallum method minimization minka model modeling models neighbourhood networks nips object olshausen over overcomplete packer pami parametric perona point ponce poultney preprint preserving principled proc raina ranzato recognition reconstructive redundant references regression regularized report representation representations research robust rodriguez salakhutdinov sampling sapiro sastry self semi sensing shen signal sparse stat statistics strategy structure supervised support szummer tangent taught tech tibshirani topic trans transfer universal unlabeled vector vision visual winn with wright yang zhang zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0242.pdf	12	Near-optimal Regret Bounds for Reinforcement Learning	acknowledgments adaptive advances agreements alexander algorithm algorithms ambuj analysis andrew apostolos auer austrian authors bartlett barto based between bound bounds brafman burnetas cambridge college community complexity conjecture convergence decision discrete dynamic editors estimation european even experts exponents eyal finite framework from fund funding general gives grant http icml indirect information infotech institute interval introduction irreducible jaksch john kakade katehakis kearns koller leading learn learning linear littman logarithmic london lower mach mansour markov martin math mdps michael model moshe near neural nips online only oper optimal optimistic ortner pages parameters part peter platt policies polynomial preprint press proc process processes processing programme programming publication publications puterman rates received references reflects regret reinforcement research results richard right ronald ronen roweis sample satinder science seventh sham singer singh sons still stochastic strehl supported sutton systems tennenholtz tewari that theorem theorems theoretical there these thesis this thomas time ucrl under unileoben university upper views wiley work yishay york
http://books.nips.cc/papers/files/nips21/NIPS2008_0607.pdf	4	Nonrigid Structure from Motion in Trajectory Space	afpac agapito algorithm amnon applications arikan articulated based biermann brand bregler capture chai closed compression construct costeira cubes cvpr data databases datta deformations degenerate dinosaur eccv estimating estimation face factorization figure form from fundamental geometry graphics gruber hertzmann hierarchical ijcv image independently irani kanade learning lihi linear linearly manor matrix method michal missing models morphable motion moving multibody multiple nips nonrigid objects optimization orthography pages pami planes priors ranklet reconstruction recovering recovery references respectively results rigid scene sequences shape shashua sheikh smeraldi solution spatial streams structure systems temporal tensor tomasi torresani tracking trans trilinear uncertainity under using video view weiss with xiao zelnik
http://books.nips.cc/papers/files/nips21/NIPS2008_0676.pdf	8	A Transductive Bound for the Voted Classifier with an Application to Semi-supervised Learning	above accurately active adaptive advances algorithm algorithms allows amini analytically annual application approximation artificial associated automatically based bayesian bengio bennett blake both bound bounds california cambridge chapelle classification classifier clustering combining communication compression computation conditional conducted conf conference contribution curves data databases demiriz derbeko dietterich discovery distribution edinburgh empirical enhance ensemble entropy error errors estimated estimation european examples explicit expoliting find first fold gallinari gibbs given good grandvalet hakkani have hill html http inference information institute intelligence international irvine joachims joint journal keogh knowing knowledge labeled language learning lecture lehmann line linear machine machines maclin makes margin mcallester mcgraw meir merz methods minimization minimizing mining mlearn mlrepository most multiple neural nonparametric notes number obtained paper passed performance press probability proc proceedings processing program proof proposed ranks references report repository research resolution results risk schapire scholkopf search second seeger self semi sets showed shown simplified solving speech spoken statistical supervised support systems technical text that theory this threshold through tool transduction transductive true understanding university unlabeled using vector vittaut voted when which with workshop yaniv york zien
http://books.nips.cc/papers/files/nips21/NIPS2008_0278.pdf	149	Hebbian Learning of Bayes Optimal Decisions	ability according acknowledgments action adapting addition anonymous approach artificial ates athena attractive attractor austrian bachler bayesi bayesian behavior behaviors belief bertsekas bishop black block brain brazilian building classical classifiers computation conditioning connections contrast corrado cortex cozman creation deal deletion deneve discriminative discussions douglas doya dynamic editors ekeberg enables especially european experimental facets fast feature features fund generalization generation generative hebb ijcai incremental inference input inspiring instances intelligence ishii jordan journal koerding konrad language lansner leads learning like machine martin matching modeled models modulated natural nature network networks neural neuro neurons newsome nips optimal organization organizing other pages parietal partial partially pattern pavlovian petersson potential pouget preparation press prim probabilistic proc proceedings programming project prokasy propagation rajesh random reasoning recognition references regard reinforcement related relearning removal representation required rescorla resulting results rewards rodney roth rule rules sandberg science scientific scriminative seco selection self shadlen signal simple since sophie spiking springer sugrue support symposium synapses synapt systems thank theory therefore this through tsitsiklis under union value version viewed wagner weights well which wiley with would written yang york
http://books.nips.cc/papers/files/nips21/NIPS2008_0178.pdf	206	Bayesian Kernel Shaping for Learning Control	adaptation advanced advances algorithm algorithms alspector alternative analysis applications approach april aspects assessing associates atkeson backfitting bandwidth bayesian beal carlin chapman computing conference connectionist control covariance cowan curve data david deformations demonstration dempster density draft driven editors eighth equivalent erlbaum estimation experts field fitting friedman from functions gaussian gelman ghahramani gijbels girosi graphical hagan hall hasselmo incomplete inference infinite information inputs internal internatinoal international inverse jaakkola jordan journal kaufmann laird learned learning likelihood local locally machine maximum mean meeds methods michael mixture mixtures modeling models moore morgan mozer multilayer networks neural nonstationary operational opper osindero paciorek pages parameter parametric peters poggio polynomial practice press problems proceedings process processes processing pseudo quality rasmussen references regression regularization relevance report research review robot robotics royal rubin rumelhart saad schaal schervish schmidt school science selection series silverman smoother smoothing snelson society solving some souza space span sparse spatial spline stanford statistical statistics stern structure summer supervised systems technical tesauro that theory touretzky tresp university using variable variational vector vijayakumar volume weighted williams workshop world
http://books.nips.cc/papers/files/nips21/NIPS2008_0054.pdf	40	Look Ma, No Hands: Analyzing the Monotonic Feature Abstraction for Text Classification	aaai acquisition adaptive annual association automatic bellman blum bootstrapping categorization chen classification colt combining computational conference control corpora criteria dagan data development disambiguation documents downey druck empirical etzioni expectation experimental extraction features france from generalized generating gliozzo guided hearst hill human hyponyms iaai ijcai information international investigating kaufmann label labeled language large learning linguistics machine mann mccallum mcgraw meeting method methods mihalcea mitchell model moldovan morgan morristown naacl nantes natural nigam pages press princeton probabilistic proceedings processes processing procs propagation publishers redundancy references relation research results retrieval rivaling scale semi sense sigir soderland strapparava supervised tagged technology text theory thesis thrun tour training university unlabeled unsupervised using washington with word workshop yarowsky york
http://books.nips.cc/papers/files/nips21/NIPS2008_0860.pdf	32	Human Active Learning	aaai active adaptive alexandre annual appear applications approach approaches artificial associative atlas attainment balcan bayesian behavior being benefit bias blum bounded bounds burnashev carey castro causal change chapter chater child childhood classification cognitive cohn colt combining communication complexity computation concept concepts conceptual conference confirmation constraints content controlled decoding development diagnosticity doherty doing domain enabling environment epigenetic estimation experimental feedback finding finland focusing from function gain gelman generalization gigerenzer gopnik hakkani handbook hanneke harvard helsinki horstein human humans ieee impact improving inference inferring info information instructions intelligence interval interventions introduction john johnson journal kalish keil kinds kruschke kushnir ladner laird language laughlin learning machine mathematiques meeting minimax mynatt nelson networks noiseless nowak oaksford observations oxford parametrique passive perform philosophy press probabilistic probability problem problems proceedings psychological psychology qian quarterly questions rationality reasoning references research results review rogers sample schapire schulz science scientific second selten semi sequential simulated sobel society solely sons specific speech spoken springer steyvers strategy structure study supervised task tenenbaumb than theory told toolbox trans transactions transmission true tsybakov tweney twenty understanding university useful using wagenmakers wason what wiley williams with worse wortman yourself zigangirov
http://books.nips.cc/papers/files/nips21/NIPS2008_0888.pdf	107	Performance analysis for L2 kernel classification	advances aggregation analysis annual april artificial asymptotically august bandwidth biometrika boosting brazil bunea cambridge canada catholique ccsd chao chapman charles classification cnrs colt combinatorial computing condensed conference contrast convex cortes data david decomposition deniz densities density dept devroye differeces discriminant discrimination discriminative dissertation doctoral eltoft erdogmus error estimation estimators from fucntions girolami hall https hypotheses ieee info information inst institut integrated intelligence jenssen jones jose kernel kernels learning least lecture lehmann linear louvain lugosi luis machine mark marzio matthew maximum meinicke method methods minimum mixture mlsp modeling networks neural nonparametric notes optimal optimally parametric pattern penalties peter polytechnic press principe probability proc proceeding proceedings processing references report review rigollet ritter robert samples scholkopf scott selection sept signal smola smoothing sparse square squared squares state statistical statistics statistique support systems taylor technical technometrics terry testing theoretic theory torbj towards trans transactions tsybakov turlach twellmann unification univ universite unpublished using vancouver vapnik vector virginia wagner wand wegkamp wiley with wolverton workshop york
http://books.nips.cc/papers/files/nips21/NIPS2008_0329.pdf	126	Nonparametric Regression and Classification with Joint Sparsity Constraints	acad adaptive additive advances algorithms analysis annals approximation artificial bounds cancer cancers carnegie centroids classification constraints convex data diagnosis diagnostic electronic expression fast framework gene generalization ieee information intelligence joint journal learning logistic machine medicine mellon models multicategory multinomial multiple multitask multivariate natl nature networks neural norm numerical part pattern prediction press probabilistic proc processing profiling recovery references regression regularization relaxation selection shrunken siam signal simultaneous spam sparse sparsity splines springer statistics systems tech technometrics thesis transactions types university using valued variable variational vector verlag with
http://books.nips.cc/papers/files/nips21/NIPS2008_1027.pdf	195	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 8	adelson affinity ahuja algorithm algorithms allocation amer anal analysis andreetto annealing annotation application approach approaches arbitrary aspect assoc based bayes bayesian beal behrens belmont between biometrika blake blei boundaries brightness buhmann california carlo carreira categories chain chinese classification coherent coling collapsed collections color coloring combining comp completion computer concurrent conditional constraint contour correlated cosegmentation cues cvpr data database december derived descombes describing detect deterministic dirichlet discover discovering distinctive distribution driven duan duxbury dynamic eccv ecological efros energy envelope estimating evaluating evaluation extent extraction feature features fernandez field fields figueiredo fowlkes freeman from functions gaussian gelfand generalized generators global goldwater gradient green griffiths guindani hebert hierarchical histogram holistic human iccv icml ieee ijcai ijcv image images incorporating inference interpolating into invariant ising jmlr johnson jordan june keypoints kolmogorov kurihara labeling labelme lafferty language latent layers learning local location lowe machine malik manor markov martin matching mathematical measuring methods minimization minka mixture mixtures model modeling modelling models monte morris moving mrfs multi multiple multiscale murphy nakano natural network neural nips nonparametric object objective objects october oliva orbanz pages pairs pami pantofaru parameter parametric parts patch pattern perona perpinan pitman poisson potts power present press priors prob probabilistic process processes random rasmussen recognition references region representation representing restaurant rice rother russell scale scene scenes schmid segmentation segmentations segmented september shape sivic smooth spatial spatially stable stat statistics subordinator sudderth suited tasks taxonomy texture that their todorovic tokens tool topic torralba toward trans transformed triggs tutorial types ueda unnikrishnan using variational verbeek vision visual volume wang weijer well welling williams willsky with woolrich workshop zelnik zemel zerubia zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0998.pdf	56	Dependent Dirichlet Process Spike Sorting	accuracy action afshar algorithm allows also alternative amplitude analysis analyzers annual appear applicable application approach artificial attenuation backwards bayesian baysienne behaving biology biomedical black borhegyi brown burst buzsaki calculations california canada carlo caron centrale chain chemical classification clustering cole components computation computing conference continuous csicsvari dagm data davy delescluse density dependent detection determined development diebolt dirichlet doucet dtermination each easily efficient engineering equations extracellular factor fast fearnhead features filters finally firing france frank freely from generalized gibbs gilja goldwater gorur harris henze hermesb hillel hippocampus hirase hybrid ieee improve improved incorporated inference inferred information infrence institute intelligence international interspike interval into intracellular journal july jump latent lewicki lille linderman logothetis machines make mamiya markov measurements medicine meng methods metropolis mixture mixtures model modeling models modles monte more multi network neural neuron neurophysiology neuroscience nguyen nonparametric number order page pages parameters parametric particle pasadena physics placed polya potentials pour pouzat predicted primates priors proceeding proceedings process propagation rasmussen recording recordings references results reversible review robust rosenbluth sahani sampler santhanam scheme sciences separation sequential shenoy simultaneous sinz slection society some sorting spike spikes spiro springer stark state stationary statistics stochastiques symposium system systems technologiques technology teller tetrode that thesis time tolias transactions uncertainty unit universit unknown vancouver variable varying viot vivo which whose with wood
http://books.nips.cc/papers/files/nips21/NIPS2008_0359.pdf	85	Effects of Stimulus Type and of Error-Correcting Code Design on BCI Speller Performance	algorithms applied behavioural biological bishop blankertz brain bulletin cambridge clarendon classification clinical coles conference courchesne cybernetics donchin electroencephalography electrophysiology engineering farquhar farwell galambos gestel gonsalvez hill hillyard ieee impact inbar inference information institute interval journal krusienski learning letters mackay martens mind netherlands networks neural neurophysiology neuroscience nijmegen oxford pattern performance planck polich press pritchard processing psychological psychology psychophysiology recognition references rehab report rugg scholkopf science sciences serby series speller systems target technical theory trans univ wolpaw woods
http://books.nips.cc/papers/files/nips21/NIPS2008_0935.pdf	146	Implicit Mixtures of Restricted Boltzmann Machines	algorithm analysis analyzers appear application approximators belief bengio bishop black boltzmann bottou carreira computation computer conditional contrastive cvpr data database deep dept dimensionality divergence exdb experts exponential factor family fields framework generic ghahramani harmoniums helsinki hinton http huang iccv icml image information invariance labeling learning lecun lighting machine machines methods minimizing mixtures mnist multiscale murray narrow networks neural nips object pages pattern perpinan pose power priors products quantitative random recognition reducing references report representational restricted retrieval rosen roth roux salakhutdinov science sigmoid springer steerable sutskever technical toronto training universal university washington welling with yann zemel
http://books.nips.cc/papers/files/nips21/NIPS2008_0421.pdf	200	A Convergent O(n) Algorithm for Off-policy Temporal-difference Learning with Linear Function Approximation	abilities absolute abstraction achieves actor advances algorithm algorithms although analysis applied approximation artificial association athena automatic available baird barto baxter bertsekas between borkar bowling boyan bradtke breaks cambridge chess classic clear complexity computer computers conditions conducted conference confirmed construction control converge convergence converges counterexamples critic current dasgupta dayan delayed difference differences different does dynamic efficiently eligibility empirical european evaluation existing experiments exploring feature first form framework francisco from fully function game gameplaying games general geramifard gordon ground have hearts high hlynka ieee important incremental information intelligence international introduction iteration joint journal jussila kaufmann koop lagoudakis learn learning least linear local machine mdps method meyn morgan muller national natural networks neural neuro optimization other paduraru parameter parameters parr performance peters policy precup predict press previous previously problem problems proceedings processing program programming rafols random recognizers references reinforcement reliably research residual rewards satisfactory schaal schaeffer scientific seem semi setting shape siam silver singh size solution square squares stable standard star state step still stochastic studies sturtevant such sutton systems tadic technical temporal terms that thesis traces transactions tridgell tsitsiklis twelfth unattainable under university update using variations vijayakumar walk watkins ways weaver were white will with
http://books.nips.cc/papers/files/nips21/NIPS2008_0314.pdf	93	Theory of matching pursuit	advances analysis anthony applications approximation bengio california cambridge chervonenkis compression conference convergence cristianini cruz data dictionaries dimension discrete eigenspectrum error events floyd francisco frequencies frequency generalization gram greedy ieee information international kandola kaufmann kernel kernels learnability learning littlestone machine machines mallat matching mathematics matrix method methods morgan neural nystrom pages parallel partitioning pattern planes points press probabilities probability proceedings processing pursuit references relating relative report sample santa scholkopf seeger shawe signal smola sparse speed systems taylor technical their theory time transactions uniform university using vapnik vincent volume warmuth williams with zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0291.pdf	111	On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor	action activity adaptive ainge algorithms analyzer apicella arkadir artif averaging bartlett barto based baxter bergman biol boulicaut cambridge cereb classical coding cogn coincidence comp comparison component compt comput conditioning conference convergence converges cortex cybern dayan decisions dependent difference differences differential distal divergence dopamine dudchenko ecml editors efficacy encode epsps esposito estimation european expectation experiments factor florian forgetting framework frotscher frustration future gerstner giannotti gradient hebbian hemmen horizon implementation infinite intell introduction izhikevich jaakkola kempter klopf kolodziejski kulvicius lafferriere learn learning linkage littman ljungberg mach machine markram math mathematical matters mesencephalic method midbrain model modern modulation monkey montague morris nature navigation networks neural neuron neuronal neurons neurosci nevet note pages pathfinding pedreschi plasticity policy porr postsynaptic predict prediction predictive press principal probability problem proceedings properties psychobiol psychol rats real references regulation reinforcement related relevance results review reward roberts rule rules sakmann santiago scarnati schultz science sejnowski signaling simplified simulated singh single solving spike stabilise standard stdp step striatum submillisecond sutton synaptic systems szepesv tamosiunaite technical temporal theory third through timing towards trends tter usefulness using vaadia ventral wagner watkins weaver wiering with
http://books.nips.cc/papers/files/nips21/NIPS2008_0929.pdf	223	Semi-supervised Learning with Weakly-Related Unlabeled Data: Towards Better Text Categorization	accuracy against algorithms american application approaches approximation artificial battle belkin bennett boyd burges cambridge case categorization category chapelle chicago classification cluster coding comp comparative comparing comprehensive cones conf constraints control convex cvpr data demiriz density dept discovery discriminative ecml edinburgh efficient estimation evaluation examples factorization fawcett fazel feature features fields framework from functions gaussian geometric ghahramani given harmonic heuristic hindi hoyer icml improving induction inference info information intelligence inter jaakkola joachims journal keerthi knowledge kohavi labeled lafferty large learn learning limited linear literature mach machines madison manifold many matlab matrix methods minimization minimum mining negative nips niyogi object olivier optimization order over packer pantofaru partially pattern pedersen press proc provost raina rajat rank recognition references refinement regularization relevant report retrieval scale schemes sedumi seeger selection self semi separation sigir sindhwani software sparse sparseness statistical statistics study sturm sukthankar sung supervised support survey symmetric system szummer taught technical term text toolbox training transductive transfer tutorial univ university unlabeled using vandenberghe vector weighting with workshop yang
http://books.nips.cc/papers/files/nips21/NIPS2008_0635.pdf	184	The Conjoint Effect of Divisive Normalization and Orientation Selectivity on Redundancy Reduction in Natural Images	acquisition algorithms america american anal analysis appear appl arias arnold arxiv aspects atick attneave august barlow bell bethge biol biological brelstaff bris buchsbaum cambridge camera carr cell cells characterization chromatic code coding cohn color colour colours compared complex component components computer constraints control cortex could database dependencies distribution distributions divisive downloaded ecological edelman edge editors effective efficient eichhorn emergence exploiting factorial field filters from gain generalized geometry gerwinn goodman gottschalk gupta hateren heeger higher http hyper hyperspectral hyvarinen ieee image images independent inference information informational intelligence john journal june karhunen kearns koster kotz learning linear lond london lurie lynch majesty manton mathematical matrix mechanisation mechanisms methodological model modeling much multivariate mutltivariate natural nature network neural neurons neuroscience nips nonlinear norm normal normalization november office olshausen opponency opponent optical optics optimization optimum order orientation orthogonality pages parraga pattern pearson perception planning pmid pooling press primary proc proceedings processes processing properties provide psychological receptive recognition reduction redundancy references removing representation responses retina review royal scenes schaaf schwartz science sciences sejnowski selectivity sensory series siam signal simoncelli simple sinz smith society solla song sons sparse spectral spherical spie stationery statistical statisticallyderived statistics striate structure suppression surround system systems theory thought transactions transmission trichromacy troscianko uniform unitary using vision visual volume wachtler wiley with zilioli
http://books.nips.cc/papers/files/nips21/NIPS2008_0370.pdf	128	A computational model of hippocampal function in trace conditioning	acquisition activity adaptive adult associative associator auditory barto behavior behavioral beylin blink bouwmeester cambridge changes classical classically comparative computation computational conditioned conditioning configuration contextual dayan dependent derivative deyo dicarlo differences difficulty discontiguous discontinuity discrimination disrupts disterhoft dopamine during dynamics eichenbaum enhances errors events eyeblink fear formation foundations function gabriel gandhi gormezano gould grossberg guan hasselmo hippocampal hippocampally hippocampectomy hippocampus international interval introduction journal kehoe learning lesions levy london ludvig machado machine matzel mcechron membrane memory methods mice mikhail model models montague moore moyer nature network networks neural neurobiology neurogenesis neuron neurophysiology neuroscience nictitating oxford patterson pavlov pavlovian physiological port predict prediction press psychological psychology rabbit rabbits reeves references reflexes reinforcement representation response responses retention review reward rodriguez role romano schaaf schmajuk schneiderman schultz science sequence shors single solomon steinmetz stimulus substrate sutton system systems talk tanaka tanapat task temporal thompson time timing trace trends tseng university vander wallenstein weiss weisz where with wood yamazaki
http://books.nips.cc/papers/files/nips21/NIPS2008_0769.pdf	113	Clustering via LP-based Stabilities	algorithm algorithms analysis approximation banerjee based benchmark between bregman buhmann charikar clustering comparison comput connectivity constant convex cvpr data dhillon divergences dueck exemplar factor fischer frey ghosh golland guha jordan kernel komodakis lashkari learn mach median meila merugu messages models motion nips paragios passing points problem references report roth science segmentation shmoys spectral stabilities syst tardos tech technical tron tziritas verma vidal weiss with
http://books.nips.cc/papers/files/nips21/NIPS2008_0692.pdf	191	Non-parametric Regression Between Manifolds	angeles applications approach bayesian belkin biological blanz bullitt comp computer conf conference correspondence cybernetics data davis design differential directional donoho drori eells energy equations estimation faces fletcher forum from functionals general geometric graphics harmonic hein hofer iccv icml ieee into joshi jupp kilian learning lemaire machine manifold manifolds mapping mappings maps mardia memoli minimizing mitra model modeling morphable multiscale niyogi object osher pages partial peters phys plate population pottmann press problem problems proc proceedings properties providence rahman random references regression report representations sapiro scholkopf schroder selected semi shape siggraph solving space splines srivastava statistics steinke stodden subspace supervised synthesis target technical their thin topics trans valued variational vetter vision wiley with york
http://books.nips.cc/papers/files/nips21/NIPS2008_0710.pdf	164	Unsupervised Learning of Visual Sense Models for Polysemous Words	academy affine algorithm allocation american anchoring animals annotated automatic barnard berg blei categories category chen collection conference criminisi cross cvpr data databases detectors development dirichlet disambiguation face fergus finding forsyth from gabbur google griffiths harvesting hebert http iccv ijcv image incremental information interest international invariant jain johnson jordan latent learned learning level lncs machine matlab mccallum methods mikolajczyk miller mining modal model modeling national object optimol pages people perona picture point ponce porter press proc program programs psiexp recognition references research retrieval rivaling scale schmid schmidt schroff science sciences scientific search sense sigir society springer steyvers stripping suffix supervised suppl technology toolbox topic topics toward unsupervised using verlag wang wenyin word yanai yarowsky zhang zisserman
http://books.nips.cc/papers/files/nips21/NIPS2008_0093.pdf	210	Learning to use Working Memory in Partially Observable Environments through Dopaminergic Reinforcement	abbott ability academy action actor adams algorithms amsterdam anatomical annals anonymous attention barto basal based behavioral beiser belief best between bilinearity brain braver cambridge capacity capture cleeremans cognitive cohen comments computation computational conference connectionist control cortex corticobasal courville cowan critic davis dayan decision discussions distinctions dopamine doya driver eleventh eligibility elsevier estimation event experimental external fellowship fifteenth find flexible following framework frank frontiers fruitful function further future ganglia gating general generate generating glanzman gradient grant hebbian helpful hidden holland hope houk human information insights instance international introduction investigate ishii jaakkola joel jordan journal kaelbling learning ledg limits link loch loops machine magical making markov markovian mccallum mcclelland memory memoryless mental mesencephalic meuleau michael model models monsell montague multiple national networks neural neuron neuroscience noelle north number observable partially performance perspectives peshkin peter phenomena policies policy pomdps predict prediction predictive prefrontal press proceedings processes processing productive program progress psychological psychology randy range reconsideration references reggia regulating reilly reinforcement remains representation representations research resolution reviewers reward role rougier rules ruppin samejima schizophrenia schultz science sciences sejnowski sequences short signals simple singh sixteenth specific state states statistical storage structure substrate suggesting supported sutton symbols system systems term thank that theoretical theories this three timing touretzky traces uncertainty using utile values will williams with without work working xviii york yoshida
http://books.nips.cc/papers/files/nips21/NIPS2008_0569.pdf	28	Covariance Estimation for High Dimensional Data Vectors Using the Sparse Matrix Transform	academic acoustics algorithm american anal analysis annals applications applied approach april association banks bengtsson bickel biology biometrics biostatistics boston bouman calculation classification complex computation conditioned conference cooley covariance daniels data dept dimensional discriminant duin efron estimation estimator estimators filter form fourier friedman fukunaga functional furrer general genetics genomics givens graphical hastie high hoffbeck icassp ieee image implications improving industrial intelligence international introduction inverse iterative jain journal kalman kass landgrebe large lasso ledoit levina limited machine march mathematics matrices matrix methods molecular morris multispectral multivar normal packets paraunitary pattern plane posterior press prior processing purdue recognition reconstruction references regularized remote report representations review rotations scale schafer sensing series shrinkage signal society soman sparse speech stanford statistical statistics stein strimmer submitted technical theory tibshirani training trans transactions transform transforming triangular tukey unitary university using usual vaidyanathan variants vectors wavelet webb well wileyinterscience with wolf york
http://books.nips.cc/papers/files/nips21/NIPS2008_0777.pdf	171	Risk Bounds for Randomized Sample Compressed Classifiers	annual artificial averages bayes bayesian blanchard bounds california chervonenkis classification classifiers colt compressed compression computer conference covering cruz data david dimension ecml european ference fleuret floyd francois gilles hammer intelligence john journal langford laviolette learnability learning lecture littlestone machine major manfred marchand margin mario mcallester mohak notes occam pages practical prediction proceedings reasearch references relating report research risk sally sample santa science shah shawe some sparsity springer stochastic taylor technical theorems theory trade tutorial university vapnik volume votes warmuth
http://books.nips.cc/papers/files/nips21/NIPS2008_0259.pdf	198	Using matrices to model symbolic relationships	annual ballard bengio biases bilinear carnegie code cognition cognitive computation computational computer concepts conference connectionist content data development discovery distributed doumas ducharme eighth embedding engineering fields framework freeman general generalization generalizations hinton holyoak hummel ieee image images inductive inference interactions janvin journal kaufmann knowledge language leabra learning linear localized logic machine mcclelland mellon memisevic methods mitchell model models morgan muggleton natural need neocortex network neural oriented paccanaro pages parallel pattern perception predication press probabilistic proceedings processing programming psychological raedt readings receptive recognition references reilly relational representations research review rumelhart sandhofer science separating series society style symbolic systems tenenbaum theory thesis toronto transactions transformations translationinvariant university unsupervised using vincent vision with
http://books.nips.cc/papers/files/nips21/NIPS2008_0187.pdf	60	A Massively Parallel Digital Learning Processor	advances agarwal algorithm algorithms allows alspector analog anguita applications architectural architecture areibi arima arithmetic asanovic automotive backpropagation basu beck board boni bottou bradski catanzaro chapelle characteristic classification combining compete computation computations compute conf conference convolutional cores cosatto cowan data decoste demonstrated design developed digital durdanovic efficient embedded enhancements evaluation even exploiting fast fastest feldman flexibility florida fpga fpgas general graf graphics guide hardware here high higher ieee image impact implementation implementations implementing importance indicate industrial information intl ipps joint kaufmann kedia kernel keutzer korekado large learning lowest machine machines magnitude massively merged mixed more morgan moussa multicore multiplication murasaki neil network networks neural neurocomputer olukotun operation order orlando over oxford packing parallel pedersen performance permits potential power powerful powertrain press previous proc processing processor processors properties purpose ramacher recognition reduce references representation resolution resource results ridella routing savich scale scaled schoeberl shinohara simard speed study sundaram supercomputer support surprising symposium synapse system systematically systems table tera tesauro than that theory this thousands training trans underline using vector very vlsi wawrzynek weston wise with without
http://books.nips.cc/papers/files/nips21/NIPS2008_0612.pdf	201	Simple Local Models for Complex Dynamical Systems	aaai aamas abstraction accurate advances agents algorithms alicia andrew approximate artificial autonomous barto bayesian benjamin between bilmes boutilier britton building computation conference context craig daphne decision decisions discovery discrete doina domains dynamical erik factorial finding framework friedman george getoor ghahramani gmtk goldszmidt graphical hanna herbert hidden homomorphisms http icml incomplete independence information intelligence international isaim jaeger james jeff jordan journal kaelbling koller learning leslie lise littman luke machine management markov mathematics matthew mdps methods michael modeling models moises monahan multiagent national networks neural nips observable operator pack pages partially pasula peregrin precup predictive probabilistic processes processing references reinforcement relational representations research reset reusable richard rudary satinder science semi series singh soni specific ssli state stochastic structure survey sutton symbolic symposium systems talvitie taskar temporal theory time toolkit tree uncertainty vishal washington with wolfe zettlemoyer zoubin
http://books.nips.cc/papers/files/nips21/NIPS2008_0707.pdf	217	MAS: a multiplicative approximation scheme for probabilistic inference	aaai adaptive algorithm allowing ambrosio analysis anytime approach approaches approximating approximation approximations based bayesian belief beliefs bidyuk biosequence bound bounded bounding bounds boyd bucket buckets cambridge carmichael causal chan cheng choi class clusters combining comp complexity computational computations constraints convex cooper dagum darwiche data dechter deletion deterministic druzdzel ecai edge efficient elimination evaluation evidential favero field framework freeman from function geiger general generalized ghahramani graph graphical hard haussler heckerman henrion hmms http ieee ijcv importance improving inference info intelligent internal introduction ismb jaakkola jair jensen jojic jordan kask kaufmann large lauritzen learning level local logic loops luby machine mateescu mean meek methods mini models morgan multiplicative network networks olesen optimization overlapping partition pasztor pearl peot phylogenetic posterior press probabilistic procedure propagating propagation quaterly reasoning recomb references report revision rish russell sampling saul scheme shachter siepel simulation stat strategies structure symbolic systems technical theory tinyurl trans uncertainty unifying university updating upper using vandenberghe variational vision wainwright weiss wexler willsky with xing
http://books.nips.cc/papers/files/nips21/NIPS2008_0738.pdf	134	Influence of graph construction on graph-based clustering measures	algorithmic analysis artificial based belkin bench benchmarks berlin between bubeck cluster clustering computing conference consistent construction cuts data density editors first fraunhofer functions graph graphs hariharan hein html http hutter identification ieee image influence intelligence jegelka kaufmann learning lecture luxburg machine maier malik markus matthias measures mikhail minimization mmaier narayanan nearest neighbor nips niyogi normalized notes objective pages partha pattern people proceedings projects quality ratsch references relation repository segmentation separation servedio spectral springer statistics supplement takimoto technical theory transactions tutorial ulrike volume
http://books.nips.cc/papers/files/nips21/NIPS2008_0884.pdf	6	Probabilistic detection of short events, with application to critical care monitoring	alarm algorithm aliferis application approach arkin artificial assumption bayesian beinlich belief canada care chavez chemical condition conference cooper critical data definitions diagrams edition embs european evaluating existing extended fackler factorial filters gillespie hall heldt ieee influence integrating intelligence intensive international jersey journal kalman kinetics long mark mcintosh medicine model modeling models modern monitoring monitors neonatal network nips norvig operations physics poor prentice proc proceedings prognosis properties quasi quinn reasoning references research river russell saddle second shachter state steady stochastic structurally suermondt switching system szolovits techniques temporally tsien uncertainty unit upper vancouver verghese williams
http://books.nips.cc/papers/files/nips21/NIPS2008_0689.pdf	73	Unifying the Sensory and Motor Comp onents of Sensorimotor Adaptation	action adaptation adaptive amsterdam basis beers behavior biol body changing combination composed computational consequence control curr daniel dependent depends donchin dynamics editors effects experiments feeling francis from functions generalization ghahramani ghazizadeh haggard history holland human important integration john jordan joseph joshua june konrad krakauer learn learning maps mazzoni mcguire memory models morasso more motor nature neurophysiol neurosci north opher optimal organization pages patrick pietro plos primitives prior quantifying ravindran rding references reza robert roshni sabes sanguineti seeing self sensorimotor sensory separable shadmehr shift simani systems task tenenbaum than that theory thoroughman through trial visual when with wolpert
http://books.nips.cc/papers/files/nips21/NIPS2008_0536.pdf	36	Using Bayesian Dynamical Systems for Motion Template Libraries	actas activity advances algorithms analysers analysis applications approach arma artificial attractor barber based bayesian beal berlin beta billard bingen biological biologically biostatistics biswas calinon cambridge chiappa cluster clustering collapsed conference coupling course current cybernetics data density directional dirichlet discrete distributions durbin estimation etzioni executed expression factor fisiologia flash fogel following gandolfo gaussian gene generalizing germany ghahramani gleave guenter hidden hochner humanoid humans ieee ijspeert increased inference infinite information inoue intelligence intelligent intensity international invertebrates jacob joint kawato kendama kober koike koopman kottas kurihara landscapes latent learning linear machine mackay markov methods mining mixture mixtures miyamoto model modelling models mohler motion motor movements nakanishi nakano neira nelson network networks neural neurobiology nonparametric opinion oxford pages palmer part perceptual perspectives peters press primitives procedural proceedings process processing rasmussen references report representing robot robots schaal series simple sleep smith space sparse spindle state storkey systems task technical technischen temporal their theory thesis time timing toussaint transactions unified univ universit unsupervised using variable variational vertebrates wada welling williams wipf with workshop xiong yeung
http://books.nips.cc/papers/files/nips21/NIPS2008_0939.pdf	62	Support Vector Machines with a Reject Option	aaai application asymptotic bartlett bengio canadian chow classification classifiers conditional conference consistency embedded error estimating first fumera grandvalet herbei hinge ieee info international interpretation journal kernel kwok learning loss machine machines mariethoz moderating murty nature networks neural nips optimum option other outputs pattern press probabilistic probabilities proceedings recognition references regularized reject research results roli series simplesvm smola some sparseness springer statistical statistics steinwart support svms tewari theory tradeoff trans twentieth unbalanced using vapnik vector vishwanathan wegkamp with workshop
http://books.nips.cc/papers/files/nips21/NIPS2008_0285.pdf	221	Supervised Bipartite Graph Inference	academic acids actions advances akaho akutsu algorithm alignment analysis aoki applications applied approach araki architectures asai bach bioinformatics biol biological biology camb canonical chechik chem chemical cheng common comparison component computation computational construction correlation correspondence cristianini data database detection development developments dobson docking drug drugbank drugs dunkel embedding euclidean exploring fast flexible from gautam genomic genomics girosi globerson goto graph greenacre guenther gunther hassanali hattori hirakawa homology identification imps incremental independent inference information integrated integration international issue itoh jones jordan journal kanehisa katayama kato kawashima kegg kernel kernels kinoshita klebe knowledgebase knox kramer kuhn learning lengauer machine matador mathematics meeting metabolic method methods models molecular multiple nature network networks neural nucleic observational occurrence okuno pages pathways pattern pereira philadelphia poggio press processing protein psychometric rarey references regularization relationships research resources saigo scholkopf selective series shawe shrivastava siam smith society space splines string structure subsequences supertarget supervised suppl system target targets taylor theory tishby tsuda tzur ueda univ using vert wahba waterman wishart yamanishi
http://books.nips.cc/papers/files/nips21/NIPS2008_0298.pdf	203	Correlated Bigram LSA for Unsupervised Language Model Adaptation	acoustics adaptation advances allocation application audio backing bayes bellegarda beyond blei broadcast cache communication conference connectionist conversation correlated data dependence dirichlet discovery distance distribution dynamic emami emnlp empirical european eurospeech extensible glass gram grams griffiths hanna icassp icslp ieee improved inference information integrating international interspeech iyer jelinek jordan journal klakow kneser language large latent learning long machine mandarin marginals mccallum methods mining minka mixtures model modeling models mrva multispan natural neural ostendorf peters phrase proceedings processing recognition references research retrieval schultz semantic signal speech spoken srilm statistical steyvers stolcke structured style syntax systems technology tenenbaum toolkit topic topical topics training transactions transcription tree unsupervised using variational versus vocabulary wallach wang with woodland words
http://books.nips.cc/papers/files/nips21/NIPS2008_0204.pdf	167	On Computational Power and the Order-Chaos Phase Transition in Reservoir Computing	analysis analyzing annealed approach approximation automata baets based benjamin bertschinger bienstman brain campe campenhout case center cerebral chaos chaotic circuits communication comparison computation computational computationally computing cortex cortical david derrida dierckx directions dynamical echo edge editors energy europhysics express framework from generation german haas haene harnessing hausler haykin information isolated jaeger joshi kristof lamina legenstein letters liquid maass machine makes markram mcwhirter methods microcircuit models movement national natschlager networks neural neurons nhout nonlinearity optical optics pages performance perties perturbations peter photonic pomeau powerful predicting prediction press principe processing random real recognition recurrent references report research reservoir roel saving scholarpedia schrauwen science sejnowski signal simple specific spiking stable state states statistical stroobandt study system systems technology time toward training unifying urrent using vandoorne verstraeten what wireless with without word wouter
http://books.nips.cc/papers/files/nips21/NIPS2008_0193.pdf	173	Mind the Duality Gap: Logarithmic regret algorithms for online optimization	abernethy above adaptive advances agarwal aggressive aistat algorithmic algorithms also analysis annual applications apply approach arbitrary argmax argmin assume available bartlett beck bianchi borwein bounds boyd called cambridge cesa collins combining computation computational conclude concludes condition conditions conference conjugate consider constraint convergence convex crammer definition dekel denote descend descent differentiable discriminant discriminative domains dual duality each easily efficient empirical equality equivalent example exists experiments exponentiated fenchel first following follows from function functions games general generalized given gradient grove have hazan hebrew hidden hold holds http huji implies imply increase information intersection introducing january journal kalai kale keshet kivinen know label lagrange lagrangian language last learning lemma lemmaf letters lewis linear link littlestone logarithmic lower lugosi machine markov maximizer maximizing methods minimax minimizer mirror models multipliers natural need neural next nineteenth nonlinear norm note objective obtain online operations optimal optimality optimization original over particular passive perceptron polyhedral prediction predictors press primal problem proceedings processing projected proof properties rakhlin ranking references regret repeated report research respect results rule schuurmans section sequence shais shalev show shwartz since singer springer still strategies strictly strong strongly subgradient such sufficient summing systems task teboulle technical tells tewari that then theorem theory there therefore thesis this thus training unified university update updates upper used using value vandenberghe vector vectors versus warmuth weak when where which with yields
http://books.nips.cc/papers/files/nips21/NIPS2008_0826.pdf	115	Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation	about achlioptas advances algorithmic algorithms analytic analyzing approximations ardelius aurell based belief bethe boolean braunstein bryant citeseer clustering clusters coloring combinatorial compiling computers conf constraint constructing conversation counting cover darwiche decomposable distributed energy european form free freeman function generalized geometry gibbs graph graphs hard hartmann html ieee information into iterative june krishnamurthy kroc krzakala landscapes mackay manipulation mann mechanics mezard montanari mulet negation normal pages pagnani parisi physical physics pnas polynomial preparation problems product propagation radenback random references review ricci sabharwal satisfaction satisfiability science seattle selman semerjian solution solutions space spain states statistical stoc stockholm sweden systems tersenghi theory transactions using valencia vertex weigt weiss workshop yedidia zdeborova zecchina
http://books.nips.cc/papers/files/nips21/NIPS2008_0694.pdf	208	Efficient Sampling for Gaussian Process Inference using Control Variables	accelerating activity advances alon analysis approximate approximations assessing barber barenco based bayesian binary bioinformatics biological biology brewer calderhead callard carlo casella chapman chopin circuits classification classifiers computation csato dept design differential dynamic edition equations expectation factor fast gaussian genome ghahramani gibbs girolami hall herbrich hidden hubank ieee implementation inference information informative inputs integrated intelligence introduction journal khanin kuss laplace latent lawerence lawrence learning machine mackay martino methods minka model modeling modelling models monte neal nested networks neural nonlinear ntnu online opper over pages pattern prediction preprint press principles process processes processing propagation pseudo ranked rasmussen rattray references regression regulation report research robert rogers sanguinetti seeger snelson sparse springer stark statistical statistics systems targets technical tomescu toronto transactions transcription transcriptional university using variable variational vector verlag williams with
http://books.nips.cc/papers/files/nips21/NIPS2008_0831.pdf	19	Learning Taxonomies by Dependence Maximization	additive agarwala ailon algorithm algorithmic algorithms alignment american analysis application applied approximability approximating approxrandom archeological bach bafna baire baker beal best beyer biological biology blaschko blei borgwardt bousquet buneman california cambridge charikar chinese clustering computer computing conditional convolution covariance cover cristianini cross cruz cybernetics dale data dependence dimensionality dirichlet discontinues discrete dissimilarity distances dubes edinburgh editors elements elisseeff evolutionary farach finding fitting fonctions foundations from fukumizu gauthier generalized gretton griffiths hall harb haussler hierarchical hilbert hilbertschmidt historical horn icml inference information institute inversion jain jasa jmlr johnson joint jordan journal kandola kannan kendall kernel kernels learning lecons luxburg macnaughton mathematical mathematics matrices matrix maximization mcgregor measures measuring metrics meyer mockett model models modified narayanan nature nested nips norms numerical operators optimal pages paterson phylogeny planck prentice press process processes recovery reduction references report reproducing restaurant robust santa scholkopf science sciences separation shawe siam singh smith smola society soda song spaces spectral speech statistical statistics stoc structures subdivision supervised target tautu taxonomy taylor technical technique tenenbaum theoretical theory thomas thorup topic transactions tree trees tutorial ucsc under university using view villars warnow waterman weiss wiley williams with
http://books.nips.cc/papers/files/nips21/NIPS2008_0680.pdf	97	Clustered Multi-Task Learning: a Convex Formulation	abernethy across alleles applied architectures argyriou arxiv attributes bach bakker bartlett basch bayesian benchmarking binders binding bioinformatics biol buus cambridge cbms clustering community complex comput conference cristianini data deodhar editors efficient epitope evgeniou factorization feature fleri framework frankild from gating ghaoui ghosh girosi harndahl heckerman heskes hoffman improves information jacob jones jordan kadie kernel known kostem lamberth lanckriet lasso learn learning leveraging listgarten lund lundegaard mach mathematics matrix methods micchelli models molecules multi multiple multitask networks neural nielson nips observational pages peptide peters philadelphia platt plos poggio pontil prediction predictions press programming rank references regional regression regularization report resource royal scholkopf selection semidefinite series sette shrinkage siam sidney simultaneous spline stat supertypes task tasks technical theory tibshirani vert volume wahba wilson with york
http://books.nips.cc/papers/files/nips21/NIPS2008_0632.pdf	189	Fast Rates for Regularized Objectives	advanced agarwal aggregation algorithms american analysis annals annual applications applied association bartlett boucheron bounds bousquet certain classes classification classifiers colt complexities complexity computational concentration conference convex convexity covering ecole editors empirical fast function gaussian hazan hebrew highdimensional hush importance inequalities introduction jordan journal kakade kalai kale kernels learing learn learning lecture lectures linear localized logarithmic london loss lugosi luxburg mach machine machines march margin mcauliffe mendelson minimizers nineteenth nips notes number online optimal optimization pages polytechnique prediction probability proceedings processes rademacher rates ratsch references regret regularization regularized result risk scovel shalev shwartz springer squared sridharan statistical statistics steinwart support tewari theory thesis tsybakov university using vector verlag williamson with zhang
http://books.nips.cc/papers/files/nips21/NIPS2008_0916.pdf	0	Online Models for Content Optimization	active adaptive advances agarwal alberta allocation analysis anderson applied approach asymptotically attention auer bandit bandits banff based bayesian bianchi broder canada cesa chakrabarti chapman click clicks clickthrough clinical collaborative collective conf conference controlled data dersimonian diklic discovery dominowska dover dynamic efficient estimating events exploration filtering finite fischer forecasting from garg generalized gittins google hall harrison huberman indices international intl joachims josifovski journal knowledge laird learning linear machine mathematics mccullagh meta mining model models moore multiarmed multiple nelder news novelty online optimal pages personalization predicting problem proc processes radlinski ragno rankings rare rate rates references resolutions richardson robbins royal rules sandeep sayyadian scalable series siam sigkdd society springer statistical taxonomies through time trials verlag west york
http://books.nips.cc/papers/files/nips21/NIPS2008_0335.pdf	121	Multiscale Random Fields with Application to Contour Grouping	active adjacent algorithm analysis based basis bayesian belongie birghtness blake bouman boundaries boundary carreira chamfer chui cipolla cluttered colour conditional constraints context contexts contour cues cvpr cybernetics deformable detect detection eccv equivalence features ferrari ferreira fevrier field fields fleming fowlkes fragment generative groups hummel iccv ieee image informative intelligence jurie labeling learning local machine malik markov martin matching mcneill model modeling models multiresolution multiscale natural nips object opelt operations pages pami part pattern perpinan perspective pinz point probabilistic proceedings processing puzicha random rangarajan recognition references relaxation rigid rosenfeld scene scenes schmid segmentation segments series shape shapiro shotton signal springer statistics stenger systems template texture thayananthan tokyo torr trans using verlag vijayakumar volume willsky yuille zemel zisserman zucker
http://books.nips.cc/papers/files/nips21/NIPS2008_0060.pdf	79	Cascaded Classification Models: Combining Models for Holistic Scene Understanding	annotated annotation antonio application auto available barrow based bayesian boosted boosting brubaker building cambridge cascades categories challenge characteristics class classes classification closing cohen comput computational conference conll contex context contextual corpus criminisi cvpr dalal database decision design detection ecognition efros elidan english ensembles epth european everingham face familiar field fields framework freeman freund from generalization gould gradients hebert hier hierarchical high histograms hoiem http human iccv ijcv imag image images interpretation intrinsic joint jones kevin koller kumar labeling labelme large learning level line linguist location loop marcinkiewicz marcus mccallum microsoft mlcw model models mullin multi murphy natura nips object objects online oriented pages pami parsing pascal penn perona prior random real recognition recovering references rehg relative report research robust rodgers role russell santorini saxena scene scenes schapire segmentation semantic single still structure sudderth sutton tasks tech tenenbaum theoretic theory time tool torralba treebank triggs unified using version viola vision visual william willsky with
http://books.nips.cc/papers/files/nips21/NIPS2008_0383.pdf	15	Measures of Clustering Quality: A Working Set of Axioms for Clustering	advances analysis based buhmann carlo cluster clustering criterion detection glen hofmann impossibility information internal kleinberg measures milligan monte neural nips optimization pattern processing proximity psychometrica puzicha recognition references structure study systems theorem theory