http://books.nips.cc/nips17.html
NIPS 2004
http://books.nips.cc/papers/files/nips17/NIPS2004_0541.pdf	112	Common-Frame Model for Object Recognition	active anal analising appearance appl approach baluja based basic bauckhage bayesian bombay boosted carneiro cascade categories class comp comparing conf construction cviu cvpr czech detection different distinctive europ evaluating examples face features fergus flexible from geman generative geometric grimson grouping hashing hummel huttenlocher hypothesis iccv ieee image images incremental india interest invariant jedynak jepson jones kanade keypoints learning lindeberg local lowe mach maire matching model models mohr moreels network neural object patt perona points pope prague probabilistic proc rapid recog recognition references republic rigoutsos roads rowley satellite scale scales schmid sensitivity simple space spatial stat structures tested testing theory tool tracking training trans unsupervised using viola vision visual weber welling with zisserman
http://books.nips.cc/papers/files/nips17/NIPS2004_0577.pdf	118	Adaptive Discriminative Generative Model and Its Applications	adaptive analysis anderson application articulated available based basis beckman bishop black blake buxton champaign cipolla collins component computations computer conditional conference contour density discriminative editor editors eigentracking eighth european extraction features fourth golub graphical hopkins http ieee illinois image images incremental institute international introduction isard isuwrm jepson johns jordan journal karhunen learning levy lindenbaum line lncs loan loeve matas matching matrix mean models multivariate ninth objects pajdla press principal probabilistic proceedings processing propagation references report representation rlin robust ross royal running selection sequential series society springer statistical stochastic subspace technical tipping tracking transactions uiuc university update urbana using verlag view vision visual volume wiley with yang york
http://books.nips.cc/papers/files/nips17/NIPS2004_0522.pdf	105	On-Chip Compensation of Device-Mismatch Effects in Analog VLSI Neural Networks	adapting adaptive addison analog anti arrays asynchronous backpropagation based biological card cell chang chip circuit circuits cmos complementary conditional conference constrained continuously control correlation correlational correlations digital diorio distortion dolenko dugger enns figueroa floatinggate four from hall hardware hasler hebbian high hirai ieee ijcnn implementation improved information inns input inspiration integrated international intl inverse iscas joint learning linear logarithmic mahajan mead memory minch mixed network networks neural nips nishizawa nonvolatile pair palmieri prentice probabilities proceedings processing reading references resolution river rule saddle shon signal signals silicon spike symp symposium synapses systems systemson terminal thesis tolerance topologically transactions tutorial university upper using vancouver vlsi walach washington wesley widrow
http://books.nips.cc/papers/files/nips17/NIPS2004_0834.pdf	190	Maximum Margin Clustering	advances algebra algorithm algorithmic allan analysis applications bansal bartlett based basri bennett berlin beyond biclustering blum boyd cambridge cancer chakra chang chawla chennubhotla classification clustering combinatorial computer conditions conference convex correlation crammer cristianini cuts data demiriz eigencuts eigenflows eigenvectors fields focs foundations functions gaussian genes genome gerstein ghahramani ghaoui half harmonic helmberg horn iccv icml ieee image inference information international interpretation jepson joachims jordan journal kandola kernel kernels kluger konrad lafferty lanckriet laurent learning linear lives machine machines malik matrix methods microarray multiclass neural nips normalized optimization pami poljak polytope positive press processing programming references regularization relaxation report research schoelkopf science segmentation semi semidefinite shawe siegelman singer smola spectral supervised support system systems taylor technical text trans transduction transductive unifying using vandenberghe vapnik vector view vision weiss with zentrum zuse
http://books.nips.cc/papers/files/nips17/NIPS2004_0831.pdf	188	Nearly Tight Bounds for the Continuum-Armed Bandit Problem	action adaptive advances adversarial adversary against algorithmica algorithms allocations analysis annals appear appl armed ascent asymptotically auctions bandit behavior bounds caching casino clinical colt competitive continuous continuum control convergence convex curve decision demand descent designs dichotomous dynamic economic efficient estimation finely finite focs function gambling game games generalizations generalized geometric gradient icml immediate infinitesimal information journal knowing learning line lists machine market math mathematical maximum medicine multi multiplicative near neural oblivious online optimal optimality optimization paging paths playing posted preprint price pricing problem proceedings processing programming references refetching regression regret reinforcement responses reward rigged routing rules search sequences setting shortest siam soda spaa spaces stage static stationary statistics stoc stochastic systems theory time trees trials using value weights with without
http://books.nips.cc/papers/files/nips17/NIPS2004_0502.pdf	95	Instance-Ba s e d Relevan c e Feedback fo r Ima g e Retriev a l	active addition albert algorithms althoff analysis available avoid based bayesian behind bhanu bloch browsing cascia case cbir chang choice classification clearly combination comparative complexity comprehensive computational computations computer concepts conference content cybernetics data databases different distance does duda early elements engine engineering especially examples exhibit faloutsos feature features feedback formulation friedman fusion giacinto good gupta handbook hart hastie high hill huang ieee image imagerover images information instance integrated intelligence introduction ishikawa jain john kibler knowledge large learning london machine made many match mcgill mcgraw mean mechanism method mindreader models modern multimedia multiple nearest neighbor number operators order parameter parameters part pattern peng performances principles probabilistic problems proc proceedings proposed provide qing querying rationale reasoning recognition references related relevance reported require results retrieval review roli salton same sample samples santini scientific sclaroff search searched sethi should showed small smeulders soca software some sons space speed springer statistical stork subramanys suitable superiority system systems taycher techniques these this through tibshrirani tong training trans tuning understanding verlag version vision visual vldb when where while wiley with world worring years york zhang zhou
http://books.nips.cc/papers/files/nips17/NIPS2004_0298.pdf	50	Outlier Detection with One-class Kernel Fisher Discriminants	adaptive advanced analysis annals applications applied asymptotic based biology buja burges cambridge classification clns cornell crossvalidation discriminant distribu douglas duda dudoit editors effective estimation feature fisher flannery functions generalisation genetics hanson hart hastie huber ieee input integration keles kendall kernel kernels knirsch laan larsen learning leen lepage likelihood linear lippmann mcmillan methods mika models molecular moody muller multidimensional networks neural nips nonlinear number numerical optimality pages parameters pattern penalized press processing program ratsch recipies references regression regularisation related report robust roth sage scholkopf shawe signal smola solla sons space statistical statistics steinhage stork stuart support systems taylor technical teukolsky theory tibshirani tion trans university using vegas vetterling volume weston wiley williamson wilson with
http://books.nips.cc/papers/files/nips17/NIPS2004_0792.pdf	177	Computing regularization paths for learning multiple kernels	acknowledge acknowledgments acta algorithm allgower angle aspects bach bartlett behavior block bonnans both boyd burden cambridge commonly computation computational compute conic continuation convex corduneanu corporation corrector cristianini cubically currently data differs duality effect efficient efron elements empirical entire fellowship following francis friedman from georg ghaoui gilbert graduate grant hastie have hessian heterogeneous hyperkernels icml indeed insight intel into inverse inversion investigating involving jaakkola jmlr johnstone jordan kernel kernels lanckriet large learning least lemarechal machine main make matrix methods microsoft mixing multiple newton nips norm notably number numer numerical optimization order particular path paths points practical predictor presented press problem problems programming provided quadratically quasi references regression regularization research results rosset sagastizbal scales semidefinite showed smola sources springer stat statistical steps such suggest support technique that theoretical this tibshirani traditional univ updating used using vandenberghe vector verlag which williamson wish with
http://books.nips.cc/papers/files/nips17/NIPS2004_0320.pdf	54	Methods for Estimating the Computational Power and Generalization Capability of Neural Microcircuits	activity arbib axon balanced bartlett based brain cambridge chaos cherkassky chervonenkis computation computing cortical data differential dimension edge edition editor framework from handbook hasenstaub john langton learning maass markram mccormick mulier natschlager nature neocortical nets networks neural neurons pages perturbations physica pnas press pyramidal real recurrent references same signaling stable states statistical theory time tsodyks turning vapnik wang wiley without york
http://books.nips.cc/papers/files/nips17/NIPS2004_0883.pdf	204	Distributed Occlusion Reasoning for Tracking with Nonparametric Belief Propagation	algorithm algorithms analysis angelov application approximate approximations articulated articulation assembling attractive based bayes belief black body bottom capturing chapman cipolla color computer constructing coughlan cvpr data deformable density detection digiteyes dynamic eccv efficient energy erik estimation estimator ferreira filtering finding forsyth free freeman from gaussian general generalized generative graphical hall hand http huang human hybrid iccv ieee ihler ijcv inference interaction interface isard jones june kanade koller lerner lids limbed loopy loose maccormick mandel markov mendonca merl mixtures model modeling models multiscale natural nets network nips nonparametric objects pages pampas partitioned people presented proc products propagation quality ramanan real recognition references rehg report rigid sampling shapes sigal sigelman signal silverman skin statistical statistics stenger sudderth technical thayananthan torr tracking tree using valued vision visual volume weiss willsky with workshop yedidia
http://books.nips.cc/papers/files/nips17/NIPS2004_0269.pdf	41	A Second order Cone Programming Formulation for Classifying Missing Data	academic advances algebra algorithms analysis applications applied based bibby blake boyd cambridge classification classifiers cone convex cortes data databases fung graepel herbrich information input interior invariant jude kent knowledge learning lebret linear lobo machine machines mangasarian mardia mathematics merz multivariate nature nemirovskii nesterov networks neural number order pattern philadelphia point press processing programming ralf recognition references repository second semidefinite shavlik siam springer statistical studies support systems theory thore uncertainty vandenberghe vapnik vector with york zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0456.pdf	88	Boosting on manifolds: adaptive regularization of base classifiers	adaboost advances algorithms analysis annals antos appear application arcing bartlett based baxter belkin boosting bounds breiman classification classifiers computation computational computer conference confidence cuts data decision dependent descent effectiveness explanation frean freund games generalization gradient graphs ieee image improved information intelligence journal kegl large learning linder line lugosi machine malik manifolds margin margins mason matveeva maximizing median methods muller neural niyogi normalized onoda pettern prediction predictions press proceedings processing rated ratsch references regression regularization research riemannian robust schapire sciences segmentation semi singer soft statistics supervised system systems theoretic theory transactions using voting warmuth washington with
http://books.nips.cc/papers/files/nips17/NIPS2004_0747.pdf	169	Modelling Uncertainty in the Game of Go	advances alan algorithm andrew artificial bayesian belief cambridge carlo computer conditional conf conference cozman critical data david dayan difference dynamics edwards elimination enzenberger evaluation extractions fabio faces feature fernando fields fortuin fotland fransisco gagliardi game generalisation generalizing goutrie graduate graepel graphs herbrich html http iberamia icann information integration international into john kasteleynswendsen kaufmann knowledge kruger labeling lafferty learning letters loops machine many marco markus mccallum memo mike models monte morgan network networks neural neurogo nicol nonuniversal pages pattern pereira peter physical playing position priori probabilistic proc proceedings processing propagation ralf random recognition references report representation representations review revision robert sbia school schrauldolph segmenting sejnowski sequence simulations sokal swendsen systems technical temporal terrance thesis thore university variable wang weiss welcome wisconsin with workshops yair zobrist
http://books.nips.cc/papers/files/nips17/NIPS2004_0429.pdf	80	The power of feature clustering: An application to object detection	advances america analysis antifaces appear application applied avidan baluja based blake boosted boosting cars cascade characterization classification classifier classifiers cognitive computational computationally computer conf conference copenhagen cvpr decision decomposition denmark detection dimensional direct duda eccv efficient eigenfaces eigensegments elad ensemble eurocolt european event example face faces fast feature features freund generalization gotsman hart hawaii heisele henry hierarchy human ieee image images information intelligence intl jones journal june kanade keren keshet kirby learning letters line machine method model mukherjee mullin multi nature network neural neuroscience nips novel object optical osadchy pages pattern pentland poggio press proc procedure proceedings processing publication rapid rare recognition reduction references rehg rejection robert romdhani rowley scene schapire schneiderman schoelkopf selection serre shai shum simple sirovich society spatio springer statistical sung systems takeo temporal theoretic theory torr trans transactions turk using vapnik verlag video view viola vision volume wileyinterscience yoav zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0097.pdf	7	Seeing through water	advances alexander algorithm algorithms andrew bernd brendan buhmann bull charles clustering collins computer conference connectivity correction cost current deduced dimeansionality dimensionality distorted dmitry dolin efficient embedding fischer flow fort framework frey from geometric glitter global goldberg ieee image images implementation inferring information inst international joachim john jojic joshua journal june kernel langford lawrence learning linear locally luchinin minimum mixture models munk natural nebojsa neural nonlinear object oceanogr optics pages pattern petersburg photographs press problems processing recognition reduction references roth roweis russia saul scaling science scripps silva slopes spatial surface systems tenenbaum transformations turlaev underwater using vision volker walter waters waves with
http://books.nips.cc/papers/files/nips17/NIPS2004_0438.pdf	82	Active Learning for Anomaly and Rare-Category Detection	active adaptive advances algorithms analysis anomaly appear arindam astrophysical atlas banerjee baram based basu bayesian blake both brazdil brinker brunswick carnegie case catalogue catlett cesar choice cirelo classifier clean clustering cohen cohn collins committee computation computational concise conference constrained cozman craw dasgupta data databases david density detection digital diversity driven durham edinburgh editors effect estimators examples experts fabio february fifth francisco from functions gagliardi galaxy gama generalization geoscience ghahramani greedy haim halbert haym heterogeneous hirsh html http icml ieee improving incorporating index information institue international jason jordan journal june kaufmann klaus kobi labeled ladner landgrebe learning leen lewis liacc lumsden machine machines mackay manfred march marclo mark massie mellon merz michael miller mixture mlearn mlrepository models mooney morgan networks neural nichol nips nirmalie norway objective online opper pages pairwise pelleg plutowski practical press probability problem proceedings processing publication publishers query raymond reasoning reducing references remote report repository richard sample sampling sanjoy scalable scientific sdss seeger selecting selection selective semi sensing sets seung shahshashani size sloan small sompolinsky southern springer statistical statlog stewart strategy submitted sugato supervised supervision support survey susan systems tech technical tesauro theory thesis touretzky training trans transactions trondheim twentieth uncertainty university universiy unlabeled unlabelled uyar vector verlag volume white william wiratunga with yaniv yoram zoubin
http://books.nips.cc/papers/files/nips17/NIPS2004_0322.pdf	55	Unsupervised Variational Bayesian Learning of Nonlinear Mo dels	adaptive advances algorithms analysis approximating attias barber bayesian beal berlin bishop blind budapest camp classification communications complexity component comprehensive computation computational computer conf cruz curbera curse delayed department description dimension distributions dynamic electronics engineering ensemble factor filtering foundation framework fundamentals gaussian general ghahramani girolami graphical group hall haykin hinton honkela hungary ieee ieice ijcnn ilin independent information integration joint journal julier kalman karhunen keeping lappalainen layer learning length method minimizing models multi networks neural nonlinear oxford perceptrons prentice press probability proc processing propagation references report research rinen roberts robotics santa science sciences separation simple source space springer state sykacek systems technical theory transactions transformations uhlmann university unsupervised valpola variational verlag weights wiley
http://books.nips.cc/papers/files/nips17/NIPS2004_0287.pdf	46	Edge of Chaos Computation in Mixed-Mo de VLSI - "A Hard Liquid"	advances analog analysing application approach based bernhard bertschinger cambridge center chaos circuits classification compu computation computers computing conference cover current data dynamics echo edge editors electronic emergent fast february fieres framework geometrical german hohmann ieee ijcnn inequalities information integrated international jaeger joint july langton lawrence linear maass march markram meier mixed mode national natschlager network networks neural neurons nips pages pattern perturbations physica press proc proceedings processing properties real recognition recurrent references report research saul schemmel schmitz scholkopf schurmann sebastian signal spiking stable state states statistical steering synapses systems tation technical technology thrun time training transactions using with without
http://books.nips.cc/papers/files/nips17/NIPS2004_0296.pdf	49	Trait selection for assessing beef meat quality using non-linear SVM	adaptive advances ageing aging albert alberta alonso alvarez analysis applications artificial assess baets bahamonde banff barnhill bartlett based baxter bayesian bayon beef belief between bharat biochemical bioinformatics boundaries bovine breed breeds buck burges cachan cambridge campo canada cancer carcasses case cattle chain characteristics classification classifiers clickthrough colour computing conference corney criteria cruz data degroeve delahunty descriptive design designing devices differences different difficult discovering discovery dumais ecai editor editors effect effects elsevier engineering engines espejo european feature food from future garcia gene gibson gispert goyache graepel greenhoff guyon handling hasted heavy herbrich implicit industry intelligence interests international izquierdo jeremiah joachims journal july kaufmann kernel knowledge large learning light longissimus lopez luaces machine machines macie making manufacture margin mart measures meat methods metric mining model morgan multivariate murray myosin networks obermayer olivan oliver olleta optimizing ordinal osoro pages paired palatability panea past peer performance piedrafita point postmortem practical predicting prediction preference preferences present press problems proceedings product production products quality quevedo rakotomamonjy ranilla rank references regression regularization relevancies research risvik rouze royo sagredo sanudo scale scholkopf schuurmans science search selection sensory serra seven sigir site slaughter smola southey spain spanish splice standard study subjective subset support systems techniques technology texture thoracis time toronto trends type usefulness user using valencia vapnik variable variables vector very villaroel wakeling weigend weight weston with workshop
http://books.nips.cc/papers/files/nips17/NIPS2004_0399.pdf	74	Co-Training and Expansion: Towards Bridging Theory and Practice	abney advances algorithms also analyzing annual applicability association assume blum boolean bootstrapping bounds cambridge cardie categories cikm classification collins combining completes complicated computational computer concepts conf conference corpora dasgupta data datasets david definition definitions detectors direction disambiguation document documents effectiveness empirical entity exist expansion failure fields follows formulae freund from functions gaussian generality generalization ghahramani ghani harmonic here ieee implies improvement inference information international jacm joachims kearns knowledge labeled lafferty language large learning left levin limitations linguistics littman lncs loss machine machines management mcallester mccallum meeting methods mining mitchell models motwani named natural neural nigam notice number ontrapositive other pages pakdd park paul pierce press proc proceedings processing proof prove raghavan randomized references relating reliably right rivaling rivest satisfies scale semi sense show sigdat similarly since singer sloan springer such supervised support suppose syntactic systems text that then theorem theory thep this thrun training transductive university unlabeled unstructured unsupervised usefully using valiant vector very viola vision visual will with without word workshop yarowsky yoav zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0116.pdf	9	Algebraic Set Kernels with Application to Inference Over Local Image Representations	aitken analysis angles assistance between cambridge caputo classical classification complexity computations computer computing conference czech darrell detection determinants deterministic discriminant distinctive driving edition edmonds entanglement european face features fisher framework from gdalyahu golub graf grey gurvits hayun hopkins icml ieee image intelligence intelligent intermediate international interscience invariant invariants italy jebara jmlr john journal june kernel kernels keypoints kondor kullback learning leibler loan local localized long lowe machine mann matrices matrix mohr moreno naquet nature neuroscience observations over pages parma pattern pedestrian prague press principal problem proceedings publishers quantum recipe recognition references representations republic research retrieval sali scale schmidt scholkopf sets shakhnarovich shashua smola springer statistical symp symposium systems term their theory transactions ullman university using value vapnik vasconcelos vectors vehicles vidal vision visual wallraven with wolf
http://books.nips.cc/papers/files/nips17/NIPS2004_0669.pdf	149	Solitaire: Man Versus Machine	advances algorithms analysis applications applied approach approximate artificial athena barto basic bellman bertsekas bertsimas block building card carlo castanon combinatorial complexity conference demands demir dimensional dynamic environment fifteenth galperin games heuristics history howard improvement information instruction intelligence iteration journal knapsack learning line machine management mansour markov mcgovern monte moss multi network neural neuro operations optimization oxford parlett policy popescu press princeton problem problems processes processing programming references reinforcement research revenue rollout rollouts routing scheduler scheduling science scientific search secomandi sequencing singh stochastic systems tesauro transportation tsitsiklis uncertainty university using vehicle with
http://books.nips.cc/papers/files/nips17/NIPS2004_0582.pdf	121	The Entire Regularization Path for the Support Vector Machine	active adaptation adaptive advances alessandro alex algorithm angle bartlett bernard beyond boser cambridge cauwenberghs chapter christopher classifiers colt comput computation conference cortes data decremental diehl editors efron elements entire fine friedman gacv gert guyon haifa hastie http incas incremental inference information international joachims johnstone joint journal katya kernel kernels labs large learning least linear machine machines making margin massimiliano method methods mining networks neural nips norm optimal optimization pages papers path paths philadelphia piecewise poggio pontil practical prediction press proceedings processing properties references regression regularization regularized report research robert rosset saharon scale scheinberg scholkopf schuurmans series shai smola solution special springer stanford stat statistical support svmlight systems technical thorsten tibshirani training trevor university vapnik vector verlag verri volume wahba with york zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0311.pdf	52	Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms	abound about active aggregating algorithm algorithms appear apple applications atlas attributes average azoury bianchi bounds brain cambridge campbell cesa classification classifiers cohn collection colt committee computation conconi connectionist convergence corpus cristianini density discriminant distributions efficient estimation exponential familiy forster freund general generalized gentile grove helmbold hinge icml information introduction irrelevant kaufmann kernels koller label ladner large learning line linear linearthreshold littlestone lnai long loss lugosi machine machines majority margin medir minimizing model morgan networks nips norm ohsu ohsumed order organization panizza perceptron prediction press probabilistic proc psychol queries query quickly references regression regret relative researchandstandards results reuters review robustness rosenblatt sampling schapire scholkopf schuurmans second selective seung shamir shawe smola some springer statistical stoltz storage strategies support symp tasting taylor test text theory threshold tishby tong training university updates using vapnik vector volume vovk warmuth weighted when wiley with
http://books.nips.cc/papers/files/nips17/NIPS2004_0822.pdf	187	Online Bounds for Bayesian Algorithms	adaptive advice algorithmica annals application approach azoury bayes bayesian behavior bianchi boolean bounds case cesa chapman classifier combining competitive conference convergence dawid density description distributions economic estimation expert exponential family feature foster freund game games generalized gibbs grunwald hall haussler helmbold international introduction jordan learning length line linear loss machine mccullagh methods minimum models multiplicative nelder panizza playing prediction predictors prequential principle proceedings rates references relative review royal schapire selection singer society specialize statistical statistics stoc that theory tutorial using voting vovk warmuth weights with worst
http://books.nips.cc/papers/files/nips17/NIPS2004_0174.pdf	19	Nonlinear Blind Source Separation by Integrating Independent Component Analysis and Slow Feature Analysis	abed able acknowledgments adel advances algorithm algorithms already anal analysis angles antoine appl artificial based beamforming been belouchrani berkes berlin between blaschke blind cardoso circuits coefficients column comon component components computation concept conference connecting correlation correlations cubica cumulant degree delayed diagonalization different discriminate distorted efficient enforces estimated existence expansion extended extract extracted fang fast feature figure first fixed foundation fourth fran furthermore gaussian girolami good grant group have higher huang icann ideas identifiability identification ieee incremental independent indeterminacy infomax into invariances isfa issue jacobi japan jean junior jutten karhunen karim lang laurenz learning letters linear ller meraim mixed mixture molgedey monomials moulines nara networks neural nonlinear nonlinearities nonlinearity nonlinearly note number only optimization order original pages pajunen permutation permutations physical plots point possible predict preparation problem proc proceedings processing recovered references relation research resulting results review rinen robust ruey scaling scatter scheme schuster second seems sejnowski separation showed shown siam signal signals signs simple simulation simultaneous slow slowly solve soon souloumiac source sources special springer statistics step structure suffices super supported symposium systems table tdsep technique terrence that third this through time tong transactions uniqueness unsupervised used using varying verlag victor volkswagen waveforms what which wiskott with work ziehe
http://books.nips.cc/papers/files/nips17/NIPS2004_0712.pdf	162	Joint Probabilistic Curve Clustering and Alignment	aach acapulco algorithm algorithms aligned aligning analysis analyzing approach artificial atlas august bayesian bioinformatics biology bishop california carlin cell cerevisiae chapman chaudhuri chudova chui church clustering comprehensive computational conf conference cross curve curves cycle data david december dimensional discovery dissertation dual editors effects eilers expression february fifth flexible frey from functional gaffney gelman gene genes graph hall hancock hybridization identification ieee intelligence inter invariant irvine january joint jojic joseph journal knowledge learning madigan marx matching mexico microarray mining mixture mixtures mjolsness models molec multi nineteenth ninth november pages pami penalties pointsets prediction press probabilistic proc ramsay random rangarajan references regression regulated rubin saccharomyces science scott series sigkdd silverman smoothing smyth spellman splines springer statistical stats step stern surajit time timewarping trajectory trans transformation translation uncertainty university unlabeled unsupervised using verlag warping washington west with workshop yeast york zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0572.pdf	117	Self-Tuning Spectral Clustering	above adopt advances aimi algorithm aligning alignment allows amounts analysis annual approach august best block bounds british bryce cannot canyon change changing circle clustering complete computation compute computer conference consider convenience convenient convention convergence converges coordinate corresponding cost counterclockwise cuts define denote deriving descent describe detail diagonality diagonalizes different digital dimensionality discussed does each edition eigenvectors element embedding enabling enough entries entry european factorization feature find finding foundations france freeman full function further givens gives golub good goyal gradient grouping guaranteed have hence here higgins hopkins ieee image increase index indices information intelligence international john jordan kannan lack learning lement lexicographical linear list loan locally long longuet machine malik mapping matrix maximal maximum measures meila might minimize minimizing multiclass near neural next nice normalized notation note number obtain obtained october optimal otherwise over overall oxford pages pair pairs parameters part pattern perona plane polito possible press proc proceedings processing proof prove provide proximity quality radians random reader recover recovering reduced reduction refer references relocalisation represent result rotation rotations rows rule sceince scheme scott second segmentation september setting shown signal similar similarly simple since size small smallest space spectral stability step stochastic substituting such sufficient suggested supression symmetric symposium systems terms than that there those thus transactions transform unifying unit university update used using values vectors vempala vetta vetterli view vision volume walks weiss when where which will wise wish with workshop wrong yields zimi
http://books.nips.cc/papers/files/nips17/NIPS2004_0405.pdf	75	Bayesian inference in spiking neurons	analysis arbitrary bayesian belief between biological boltzmann brain britten brown cambridge cerebral circuits codes comparison computation correctness cortex cortical current decision ditterich editors efficacy fleet freeman function gaussian graphical hinton inference information integration integrators journal knill kording learning leen lewicki likelihood machine machines making markram mazurek models motion movshon muller nature neocortical neural neurobiology neuronal neurons neuroscience newsome noise olshausen opinion organization pages perception perceptual performance press probabilistic processing propagation psychophysical pyramidal recurrent redistribution references richards roitman role sensorimotor shadlen solla spiking synaptic system topology tsodyks university velocity vision visual volume weiss wolpert
http://books.nips.cc/papers/files/nips17/NIPS2004_0621.pdf	135	Exponentiated Gradient Algorithms for Large-margin Structured Classification	algorithmic altun andrew appear available based bounds bunt cambridge campbell carroll classifiers collins colt computation conditional convergence crammer cristianini data descent developments distribution editors estimation exponentiated fernando fields free giorgio gradient guestrin harry hidden hofmann http icml implementation information interdependent introduction joachims john journal kernel kivinen kluwer koller labeling lafferty large learning linear long loss machine machines margin markov mccallum mcollins methods michael models multiclass multidimensional multiplicative networks neurocolt nips other output paper parameter parsing people pereira pollard practice predictors press probabilistic problems proceedings processes random references regression relative report research satta saul segmenting sequence shawe singer spaces springer statistical stochastic structured support taskar taylor technical technology theory this tsochantaridis university updates updatings vector verlag version versus warmuth
http://books.nips.cc/papers/files/nips17/NIPS2004_0152.pdf	16	Semi-parametric exponential family PCA	advances algorithm analysis annals applied august bartholomew bishop california chapman class collins combined component components computation consistency convergence curves dasgupta data david diego dimensions discrete distribution edition estimation estimator exponential factor family general generalization generalized geometry girolami hall http ieee incidental information intelligence journal kaban kendall kiefer knott latent library likelihood likelihoods lindsay linear machine many martin mathematical maximum mccullagh mixture model models monographs nelder neural nitely orlitsky oxford parameters parametric pattern presence press principal probabilistic probability processing properties reducing references report revisited royal sajama schapire semi series society statistical statistics systems technical theory tibshirani tipping trait transaction ucsd university variable visualization volume wolfowitz
http://books.nips.cc/papers/files/nips17/NIPS2004_0762.pdf	172	Sharing Clusters Among Related Groups: Hierarchical Dirichlet Processes	aldous algorithms allocation american analysis annals approximate association bayesian beal berkeley berlin blei california chain chinese college computational conjugate constructive definition density department dirichlet ecole escobar estimating estimation exchangeability ferguson flour gatsby gaussian ghahramani graphical griffiths have hidden hierarchical inference infinite integrating jmlr jordan journal knew latent london maceachern markov methods mixture mixtures model models muller neal nested nips nonparametric option pages priors probabilites problems process processes rasmussen references related report restaurant saint sampling sethuraman sinica some springer statistica statistical statistics technical tenenbaum thesis topic topics unit university using variational volume west where xiii
http://books.nips.cc/papers/files/nips17/NIPS2004_0697.pdf	158	Sub-Microwatt Analog VLSI Support Vector Machine for Pattern Classification and Sequence Estimation	academic analog approach artificial bahl bicmos bourlard canada cauwenberghs chakrabartty chandrakasan circuit circuits cocke codes conf connectionist decoders decoding design devices dissipation dorio dsps efficient electron energy error falls forward francisco hasler haussler helfenstein hidden hybrid icpr ieee implementation inform intelligence iscas isit isscc jaakkola jelinek johns july kernel kluwer large lazzaro learning limits linear lippmann loeliger lustenberger machines margin markov martin mead micropower minch minimizing model models morgan nature networks niagara optimal pattern power probabilistic probability proc propagation rate raviv recognition references regression sensor sensors sequence seventh shakiba signal silicon single solid speech springer state statistical statistics symbol symp synapse systems tarkoy theory trans transactions transistor vancouver vapnik verlag viterbi vittoz vlsi wang wawrzynek ways wireless workshop york
http://books.nips.cc/papers/files/nips17/NIPS2004_0274.pdf	44	The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees	adaptive advances aggressive algorithm algorithms amnesia amnesic annals apostolico applications april auer automata basic bejerano best bianchi biology bottom buhlmann cambridge cesa chains classification classify columbia computational computer conference confident context crammer cristianini decision dekel detection efficient eskin extension fast first fourteenth generalization gentile helmbold hierarchical ieee information international introduction intrusion journal kearns keshet large learn learning length line linear machine machines mansour margin markov memory method mixture modeling near nearly neural online optimal passive pereira power predicting prediction press probabilistic proceedings processing properties proteins pruning references schapire sciences self sequence shalev shawe shtarkov shwartz singer space sparse statistical statistics support system systems taylor techniques theory thesis time tishby tjalkens transactions tree trees twenty university vapnik variable vector weighting well wiley willems with wyner
http://books.nips.cc/papers/files/nips17/NIPS2004_0238.pdf	34	Maximal Margin Labeling for Multi-Topic Text Categorization	addison advances algorithmic algorithms baeza based bernhard berthier boostexter boosting categorization celine claire conference crammer editors european features gunnar ieee implementation information introduction joachims john journal kazumi kernel klaus koby koji learning machine machines many mika mixture models modern muller multi multiclass naonori nedellec neto networks neural number pages parametoric proc processing ratsch references relevant research retrieval ribeiro ricardo robert rouveirol saito schapire scholkopf sebastian singer sons statistical support system systems text theory thorsten topic transactions tsuda ueda vapnik vector vladimir wealy wiley with yates yoram
http://books.nips.cc/papers/files/nips17/NIPS2004_0425.pdf	78	Multiple Alignment of Continuous Time Series	acids acoustics advances aebersold alan algorithm analysis anders architecture based bengio between bioinformatics biological biology bridging cambridge cell chiba computational conference data durbin dynamic eddy editors frasconi graeme guided hidden icassp ieee information input journal kaufmann kearney krogh leen mann markov mass matthias meets mitchison models morgan nature neural nucleic output pages paolo poritz press probabilistic proceedings processing programming proteins proteomics readings recognition references richard ruedi sakoe sean sequence signal spectrometry speech spoken systems tesauro thibault tour touretzky univ volume word yoshua
http://books.nips.cc/papers/files/nips17/NIPS2004_0832.pdf	189	Learning efficient auditory codes using spikes predicts cochlear filters	acoustic acoustical adapted america annual atick auditory barlow black block blue both brain cambridge carney code codes coding communication computation continuous control corpus could curves dahlgren dark daubechies dictionaries discrete ecological editor editors efficient fibers fidelity figure fiscus fisher fourier frequency function gain gammatone gammatones garofolo glides ieee image impulse information journal kbps kernels lamel learned lewicki light made mallat matching mcduffy messages models natural nature nerve network neural neuroscience olshausen pages pallett patterns perception phonetic population possible press principles probabilistic processing provide pursuits rate references relative representation responses review rosenbluth schwartz sensory shekhter signal simoncelli smith society sounds sparse speech spike spikes spiking statistics structure theory time timit transactions transform transformation underlying using varying wavelet well were with zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0307.pdf	51	Mistake Bounds for Maximum Entropy Discrimination	accuracy additive aggressive algorithm algorithms analog analysis angluin annals annu applications approach approximate approximation automata averaging avrim berger best bianchi blackwell blum boosting bound bounds cesa circuits classifiers colt complexity comput computation computational computer concentration conf constraints convergence convex cover crammer cruz csiszar dekel della dependent descent discrimination distributions divergence dubhashi elements entropy exponential exponentiated families fast focs functions geoffrey geometry gordon gradient hamiltonion helmbold herbster holden http icml ieee improved inequalities inform information jaakkola jebara journal kivinen koby krogh langford language learning lect likelihood line linear linguistics littlestone logarithmic long loss machine majority margin matchings math mathematical maximization maximum measure measures megiddo meila methods minimax minimization minimizing mistake monograph multiclass natural nips novikoff online optimization over pages panconesi passive payoffs perceptrons pietra pinsker prediction predictive predictor preliminary press probabilistic probability problems proc proceedings processes processing projection proofs random randomized references regret regularized related relaxed research sample santa sciences seeger sequential sets shalev shwartz singer some stability steepest stoc symposium system theorem theory thesis thomas threshold topsoe tracking trans transactions ultraconservative updates vaidya valiant variables vector version versus warmuth weighted wiley winnow with yoram york zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0588.pdf	123	Maximum-Margin Matrix Factorization	advances alon american amnon analysis anat application approaches approximation bartlett benjamin borchers bounds boyd collaborative collins component conference control cristianini csdp dasgupta error exponential factorization family fazel filtering generalization ghaoui haitham heuristic hindi hofmann information institute international jaakkola jordan journal kernel lanckriet large latent learning levin library machine margin marlin maryam massachusetts master matrices matrix methods minimization minimum modeling models nathan nature negative neural objects optimization order parts perspective prediction principal principle probabilistic proceedings processing profiles programming rank ranking rating references research schapire semantic semidefinite seung shashua software srebro stephen syst system systems technology thesis tommi toronto trans university unsupervised user volume weighted with
http://books.nips.cc/papers/files/nips17/NIPS2004_0196.pdf	24	Discriminant Saliency for Visual Recognition from Cluttered Scenes	alvey analysis appear ashua attention based bauckhage beyond brady canada carneiro chapter class claus combined comparing computational computer computing conf conference connected copenhagen corner cvpr czech denmark description detection detector detectors discriminant discrimination diversity early edge european evaluating feature features fergus fiducial fitzgibbon from globally harris ieee image independence information intelligence interest internat international invariant itti jones journal july kadir koch learning letters local locally lowe machine malik marginal maximum mechanisms model modeling mohr natural network neural niebur november object papathomas pattern perona point points prague preattentive press proc proceedings processing psychophysics rapid real recgnition recognition references regognition reliable republic retrieval robust role sagi saliency salient sampling scalable scale scaleinvariant scene scenes schmid sebe segmentation selection statistical stephens structural structures system texture theories time trans ullman unsupervised using vancouver vasconcelos viola vision visual what with workshop zisserman
http://books.nips.cc/papers/files/nips17/NIPS2004_0506.pdf	97	Hierarchical Distributed Representations for Statistical Language Modeling	advances aggregate alfakih algorithm annual applications applied association banff based bengio borchers brown cambridge canada cardie chen class collins completion computation computational conference confernence csdp data desouza dietterich dimensionality distance ducharme editors emnlp empirical estimation euclidean experts first generative goodman gram hierarchical histogram hofmann icml information international jacobs janvin jauvin jelinek jordan journal kernel khandani lafferty language learning leen lexicalised library linguistics machine manifolds markov mathematics matrix meeting mercer methods mika mixed mixtures model modeling models natural neural nonlinear occurrence optimization order pages parameter parsing pattern pereira pietra press probabilistic problems proceedings processing programming providence puzicha recognition reduction references research retrieval saul scholkopf second semidefinite smoothing software solving speech statistical study systems techniques three transactions translation tresp twenty view vincent volume weinberger weischedel wolkowicz zhai
http://books.nips.cc/papers/files/nips17/NIPS2004_0799.pdf	179	Proximity graphs for clustering and manifold learning	achan allan anal application approach april august based belkin bishop blatt brendan chakra chennubhotla christopher cluster clustering clusters computation computer computers cuts cvpr daniel daphna data database december describing detecting dimensionality domany efficient eigencuts eigenflows eigenmaps embedding eytan felzenszwalb framework frey gdalyahu geometric gestalt global granular graph grouping half huttenlocher icml ieee image intel jepson jianbo jitendra john joshua june kannan kilian langford laplacian lawrence leahy learning linear lives local locally machine magnet malik manifolds marcelo methods michael mikhail model neighborhood networks neural nips niyogi nonlinear normalized november october optimal organization oxford partha pattern pedro perceptual press programming recognition reduction references representation richard romer rosales roweis saul science segmentation self semidefinite september shai silva spectral stochastic structure tenenbaum theoretic theoretical theory trans university unsupervised using vision weinberger weinshall werman wiseman yoram york zahn zhenyu
http://books.nips.cc/papers/files/nips17/NIPS2004_0233.pdf	30	Synchronization of neural networks by mutual learning and its application to cryptography	addison arbib asiacrypt biehl bornholdt boutin brain broeck cambridge caticha city communication computation cond contribution copelli cryptography eisenstein engel europhys generalization handbook hertz introduction kanter kessler kinzel klein klimov krogh learning lett line mechanics metzler mislovaty mityagin networks neural palmer perchenok phys practice press priel private published redwood reents references rompaey rosen schroder schuster shamir statistical stinson theory university urbanczik wesley wiley
http://books.nips.cc/papers/files/nips17/NIPS2004_0719.pdf	163	Probabilistic computation in spiking populations	about anderson attractor bartlett baxter bayesian beers bialek boltzmann brown carpenter circuits codes cognitive computation computational computations control dayan decisions deneve denier distributional doubly efficient essen estimation from gold gradient hinton horizon ieee imitating inference infinite information integration intelligence interpretation jair knill kording latham learning life likelihood machines marks movements multiplicity nature networks neural neuralcomputation neurobiological neurons neurophysiol nips optimal orientation paris perception physiology policy population position pouget press probabilistic propriocetive recurrent references representation research rieke robinson ruyter saccadic sahani saunders sciences sensorimotor sensory shadlen simultaneous sittig skew spikes spiking statistically steveninck stimuli surface symmetry systems that trends uncertainty underlie using vision visual warland williams with wolpert zemel zhang zurada
http://books.nips.cc/papers/files/nips17/NIPS2004_0415.pdf	76	Stable adaptive control with online learning	aaai adaptation adaptive addison addisonwesley agents algebraic american analyzing anderson applied astrom barto bjorn blondel boundedness branicky checking combinations composite computation condition conf conference continuous contr control controller daniel decision design dynamic edition emani examples exponential farrell feedback franklin from functions hall hespanha hybrid ieee including intelligent international jacques jean joao johansson karl khalil learning lett letters liberzon linear linearly locally lyapunov matrices methods michael minimize moore morse naeini nakanishi nonlinear often optimal pages pair papers perkins piecewise possible powell prentice proc proceedings products quadratic rantzer references reinforcement reparameterized robots safe schaal slotine small sometimes stability states structure such switched switching symposium syst systems takes theory time tsitsiklis undecidable values very weighted weiping wesley with wittenmark
http://books.nips.cc/papers/files/nips17/NIPS2004_0640.pdf	141	Learning, Regularization and Ill-Posed Inverse Problems	academic academy accepted adaptive algorithm algorithms amer analysis andreas andrey appear applications applied approximation april aronszajn arsenin august available bounded bull cambridge caponnetto cbcl colin combinatorics communications comput computational computer consistency control convergence cucker cynthia czech devroye differences different discre discretization disi dordrecht editor electronic empirical engl error evgeniou felipe foundations fritz from generalization girosi group gyorfi hanke heinz http ieee information institute interscience inverse january john journal kaiserslautern kernel kernels kluwer kurkova learning leastsquares lecture london lugosi machine machines martin massachusetts massimiliano math mathematical mathematics mcdiarmid method minimization model mukherjee necessary networks neubauer niyogi norwich note number other pages paper parameter pattern pereverzev person poggio pontil posed preface press princeton probabilistic problem problems proc processing program publication publications publishers recognition references regularization regularized report reproducing republic research revision rifkin risk rosasco rosascol rudin russian schock science sciences scripta selection sergei series signal smale solutions sons springer stability statistical steinwart steve submitted sufficient supervised support surveys systems technical technology theodoros theory tikhonov tomaso trans transaction translated translation type unige univ university vapnik vasiliy vector vera vito vladimir volume washington wiley winston york
http://books.nips.cc/papers/files/nips17/NIPS2004_0136.pdf	12	Resolving Perceptual Aliasing In The Presence Of Noisy Sensors	aaai accurate acting aggregation algorithm algorithms aliasing ance approach approaches barto best carnegie cassandra chrisman computation computational conf control controllers december decision differences distinctions domains eligibility environments experimental external hidden hochreiter icml introduction jaakkola jordan kaelbling learning linguistics littman loch long markov markovian mccallum mellon memory memoryless meuleau mitchell models more neural nikovski nips observable optimally pages partially perception perceptual peshkin policies policy predictive press probabilistic problems processes references reinforcement report representations result results robot rochester schmidhuber selective short signifi singh state statistical stochastic sutton technical term tests thesis traces university using volume williams with
http://books.nips.cc/papers/files/nips17/NIPS2004_0439.pdf	83	Efficient Kernel Machines Using the Improved Fast Gauss Transform	advances again algorithm algorithms american anal approaches approximate approximation architectures barber bartlett bayesian bern boston cambridge chapter chicago classification classifiers clustering college company comput computation computer computing conf conference data davis dealing density discovery distance duraiswami editor efficient eppstein estimation everything fast feder fine first francisco fresh fung gauss gaussian geometric girosi gonzalez greedy greene greengard gumerov hard historical hochbaum iccv ieee illinois improved information intell intercluster international jones journal kaufmann kernel knowledge learning least letters look mach machine machines mangasarian maryland mathematical mathematics matrix maximum method minimize mining models morgan multipole nature networks neural notices nystrom observational optimal pages park particle pattern philadelphia phys pitsianis poggio press problems proc proceedings process processes processing proximal publishing rank reduced references regression regularization report representations research review rifkin rokhlin rsvm scheinberg scholkopf science seeger siam simulations smale smola society sparse speed spline springer squares statist statistical strain support suykens symp systems technical theoretical theory thesis training trans transform umiacs univ using vandewalle vapnik vector version wahba williams with yang york
http://books.nips.cc/papers/files/nips17/NIPS2004_0482.pdf	93	Instance-Specific Bayesian Model Averaging f o r Classification	adding addition additional algorithm algorithms also anonymous apply artificial attributes averaged averaging based bayesian been behavior being better biomedical care classification comments computational conference continuousval data dgme diagnosis discretization does each eager effect efficiency examine example explore extends fayyad framework francisco frank from further future general grant have helpful heuristics hoeting implementations improve improvement improves informatics instance instancespeci intelligence intelligent interest international interval introduced investigate investigation irani java joint just kaufmann kontkanen lazy learning library like machine madigan mateo medicine methods mining model models more morgan multi myllymaki national network networks nowl number obtain other overall pages patient pearl perform performing phases pittsburgh plan practical prediction predictions presented probabilistic proceedings prognosis program provides raftery rather reasoning references respect restricted results reviewers rules science search selected selection several show shown silander spaces specific statistical stockholm such supervised support supported sweden systems than thank that their therapy thereby these thirteenth this three tirri tools training tutorial ultimate uncertainty university unrestricted used using volinsky webb well which will with witten work would zheng
http://books.nips.cc/papers/files/nips17/NIPS2004_0094.pdf	5	Maximum Likeliho o d Estimation of Intrinsic Dimension	advances algorithm appear approach attractors bailey based belkin brand bruske camastra canada charting classification clustering computers costa data department dimension dimensional dimensionality domeniconi donoho dubes duin edmonton eigenmaps embedding entropic entropy estimating estimation estimator estimators evaluation finding fractal framework from fukunaga geodesic geometric global graphs grassberger grimes gunopulos hero hessian high ieee information intrinsic jain kegl kollios koudas labelled landford laplacian learning linear locally manifold maps measuring near neighbor nips niyogi nonlinear numbers olsen optimally packing pages pami partially pettis physica point preserving press procaccia proceedings processes processing random reduction references report roweis saul science sigkdd signal silva snyder sommer spectral stanford statistics strange strangeness structure technical techniques tenenbaum topology trans university using verveer vinciarelli visualization vlachos volume wiley with york
http://books.nips.cc/papers/files/nips17/NIPS2004_0257.pdf	38	Semi-supervised Learning via Gaussian Pro cesses	advances agresti algorithms analysis approximate approximations artificial aston bayesian beyond cambridge categorical chapelle cluster conference covariance csato data discriminant estimating family fast fisher francisco from gaussian generative graphical herbrich icann inference information informative institute international interpretation iterative joachims john kaufmann kernel kernels label large lawrence learn learning linear machine machines making massachusetts methods minka models morgan networks neural noise pages practical prediction presence press probabilistic proceedings process processes processing references regression scale scholkopf seeger semi sollich sons sparse statistical supervised support systems technology theory thesis university vapnik vector weston wiley williams with york
http://books.nips.cc/papers/files/nips17/NIPS2004_0143.pdf	15	Generative Affine Localisation and Tracking	adelson advances appear appearance available based bayesian bishop clustering computation computer conf editor engine factorial fast fleet flexible frey from generative ghahramani graphical greedy http ieee image images inference information introduction invariant jaakkola jepson johnwinn jojic jordan journal kluwer large layers learning machine maraghi message methods model models moving multiple networks neural objects online pages parts passing pattern proc processing recognition references representing research robust saul scale spiegelhalter sprites statistics systems titsias tracking transactions transformation unsupervised using variational vibes video vision visual volume wang washington williams winn with workshop
http://books.nips.cc/papers/files/nips17/NIPS2004_0234.pdf	31	Learning Hyper-Features for Visual Identification	algorithm amit angle annals answer applied approach area automatized bayesian beymer boosted bottom brady cars cascade categories center challenge chapman classification coifman computation computational computer conference cvpr densities description detection distinctive eccv efron example expertise faces features fergus figure flexible from fusiform gauthier geman generalized hall hastie iccv ijcai image images informative international invariant johnstone jones journal kadir kanade keypoints learning least left level linear lowe malik many matches matching matsakis mccullagh mclauchlan measuring miller model models naquet nature nelder neural neuroscience object objects ostland parameters pasula perona processing rapid real recognition references regression right ritov russell saliency scale schneiderman selection sensors shared shot simple statistical statistics subordinate system tarr these through tibshirani time tracking traffic transforms ullman unsupervised using vidal viola vision visual weber welling with
http://books.nips.cc/papers/files/nips17/NIPS2004_0851.pdf	195	Constraining a Bayesian Model of Human Visual Speed Perception	abstract adelson alan analysis anderson atick bayesian biological bradford brain cambridge carandini chapter coherent computation computational constraint contrast deangelis dependent depends dept despite detection discrimintation distributed dong eero electrical engineering federal fleet frequency green grzywacz human hurlimann illusions images institute integration january journal june kiper koerding learning leslie likelihoods macaque machine march mckee model modeling models motion movement moving nakayama natural nature network networks neural neurons neuroscience nover optimal optimization pages perceived percept perception physics plaids precise probabilistic processing psychophysics random rate references representation research reveals sensorimotor signal silvermann simoncelli speed stages statistics stocker stone swets swiss switzerland synthesis systems technology temporal testing theory thesis thompson time tuning variations varying velocity vision visual weiss welch wiley wolpert york yuille zurich
http://books.nips.cc/papers/files/nips17/NIPS2004_0852.pdf	196	A Machine Learning Approach to Conjoint Analysis	active adaptive advanced advances algorithm anal analysis annu appear applications approach approaches artificial available balance barber bayesian biological boser boundaries bounds boussios chapelle choice choicebased classification classifiers college comput computation computing conjoint convex cybernetics designs efficient error estimation evgeniou expectation gaussian generalized ghahramani graepel guyon harchaoui hauser haussler hbrel herbrich hierarchical huber ieee importance inference information institute intell intelligence invariance jaakkola jebara jordan journal kernel kernels koller large learning lectures logistic london mach machine machines margin marketing methods micchelli modelling models multi neural obermayer optimal ordinal paper pattern planck polyhedral pontil practice press principles probabilistic proc processes processing rank references regression report research robust sawtooth sawtoothsoftware scholkopf schwaighofer science series shtml simester smola software springer statistical statistics support systems task technical techpap text theory tipping tong toubia training trans tresp university utility vapnik variational vector volume williams with workshop zacharia zwerina
http://books.nips.cc/papers/files/nips17/NIPS2004_0800.pdf	180	Machine Learning Applied to Perception: Decision-Images for Gender Classification	advances ahumada algorithms analysis annals applied automatic automation based bayesian bootstrap bruce bubbles burton categorization cheng classification cognitive comparison computation computer conference confidence control edition eigenfaces estimation eugenics face faces fisher fitting from function gender generalized gesture golomb goodness gosselin graf gray hancock hill human ieee image information insights intelligence internal international intervals journal kernels lawrence learning lerner level machine measurements method models moghaddam multiple nature neural neuroscience noise offit pattern pentland perception perceptions perceptron phillips portrait press problems proceedings processing psychology psychometric psychophysics recognition reed references relevance remote research reveal reveals ross sampling scholkopf schyns second sejnowski smola sparse springer statistical support systems tasks taxonomic technique theory tipping toole transactions turk using vapnik vector vision visual weights wichmann wild with yang
http://books.nips.cc/papers/files/nips17/NIPS2004_0271.pdf	43	Linear Multilayer Independent Component Analysis for Large Natural Scenes	adaptive after algorithm algorithms along analysis antoine approach approximately approximation architecture based basis beamforming beate bell blind cardoso cells comon compared component components computation concept contrast contrasts corresponds cortex cross curve curves deconvolution decrease decreases decreasing detectors displays dotted each edge efficient equivariant fast figure filters fixed francois from function gaus generated global gradient granada hateren herault high hyvarinen ieee images independent information integrating international iteration iterations japan jean journal jutten kazunori laheld large layer layers linear lmica lncs local logscale london mapping matsuda maximization maxkurt modules multidimensional multilayer nara natural networks neural neurocomputing neuromimetic normal number ones optimizations order pages pairs part phase pixels point points press primary proceedings processing random references representative research respect respectively results robust royal scaling scenes schaaf sejnowski separation show shows sian signal signals simple size small society souloumiac source sources spain springer stochastic systems times topographic transactions using vectors verlag vision visual volume with without yamaguchi yoshitatsu
http://books.nips.cc/papers/files/nips17/NIPS2004_0530.pdf	108	On the Adaptive Properties of Decision Trees	achieve adapt adaptation adaptive advances aggregation alamos algorithm although alto american analysis annual appear association audibert available bartlett based bayesian berkeley bianchi blanchard boosting bounds cambridge cesa classification classifiers colt combined complexity computational computationally condition conditions conference consider constructed convergence convexity cscott data datadependent ddts decision department dimension discrimination discussion dissertation dyadic each edge efficient empirical estimation exact factor fast features geer generalization goldman heidelberg http ieee inform information jordan journal june laboratory learning lugosi machine machines mammen manifold mansour margin mcallester mcauliffe minimax minimization national near neural nobel noise nonparametric novel nowak number online optimal oracle palo paris part penalized penalty preprint press procedure proceedings processing pruning rate rates references regularized relevant research rice risk root rozenholc saul schafer scheme scholkopf scott scovel separately shawe simplify singer smooth spatially springer square stat statistical statistics steinwart support supporting systems taylor tech theory thirteenth thrun trans tree trees tsybakov universite university variation vayatis vector verlag where with within yang yield
http://books.nips.cc/papers/files/nips17/NIPS2004_0629.pdf	139	Schema Learning: Experience-Based Construction of Predictive Action Models	aaai acquisition action advances application approach artificial autonomous balac benson classification concept conference constructivist curve cybernetics discovery domains drescher environment experimentation fikes fisher formation from gaines grounded grounding hidden ieee incomplete incremental inductive information intelligence international jong king kudo learn learning letters littman machine made mccallum minds models morrison multidimensional neural nilsson oates observable observation operator pages pardoe passingthrough pattern perception planning practice predictive press problem processing proving reactive recognition references refinement regions regression reinforcement representation representations rochester role scott selective shen shimbo singh solving spring state stone strips sutton symposium systems theorem thesis toyama trees university unobservable using wang with
http://books.nips.cc/papers/files/nips17/NIPS2004_0757.pdf	170	Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units	about abstract adaptation albrecht analyses analysis anderson annual atick barlow basis bell borst cell cells codes coding colorado communication compared comparison component components comput computation cone cortex deangelis denver derived does domain edge editor employed field fields filters framework frequency from gradedpotential hateren hyvarinen image images independent information inui john joint journal karhunen know laughlin lewicki lond macaque meeting messages modeling mosaic natural nature network neural neurophysiology neuroscience noise olshausen overcomplete page pages population possible press primary principles probabilistic proc properties rate ratios receptive redlich reduction redundancy references research responses retina revisited ringach rosenblith ruyter scenes schaaf sejnowski selectivity sensory signal simoncelli simple society sons sparse spatial spatiochromatic spie statistics steveninck strategy structure symmetry synapses syst theoretic theory theunissen thorell transfer transformation underlying valois vision visual wachtler wavelet what wiley with
http://books.nips.cc/papers/files/nips17/NIPS2004_0471.pdf	91	Supervised graph inference	acids advances algorithm analysis analyze anders application applied approach architectures assigning bach bayesian belkin bioinformatics biol biology black blue bock botstein brown budding burges canonical carroll cell cerevisiae chicago chung cluster clustering clusters comparative component comprehensive computation computational computer conference continuous correlated correlation correspond cycle dashdot dashed data databases detecting different diffusion display distance driven each editors eigenvectors eisen eisenberg emili engineering examples expression extraction falco false features figure framework friedman from function functional functions futcher gene generalized genes genome genomenet genomewide genomic geometric gerke gerstein girosi global goto gough graph greenbaum greenblatt higher howson hybrid hybridization identification ieee independent index indicator information integrated interaction interactions international jansen jones jordan journal kanehisa kawashima kegg kernel kernels kexp kint kloc kluger kphy krand krogan learning line linial localization machine manifold marcotte mathematics matsuno methods metric microarray miyano models muller multiple nachman nagasaki nakaya nature network networks neural nips niyogi nucleic observational order pages parameter parameters patterns pazos pellegrini petri pharmacogenomics philadelphia phylogenetic picture pictures pnas poggio positives predicting prediction press primary principal proceedings profiles protein references regularization regulated regulatory report represent representation research respectively rice russell saccharomyces scholkopf schrolkopf science scores segmentation selected sequences series shea sherlock siam side similarity sindhwani smola snyder society spectral spellman splines structure support technical test theory thompson train training trees true tsuda unifying university using valencia various vector vert view vision wahba weiss weissman when with xing yamanishi yeast yeates zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0164.pdf	17	Density Level Detection is Classification	aggregation alamos algorithms amer analysis anomaly appear aproach assoc cambridge chang chih chung classification classifiers clustering clusters comput computation concentrations consistency contour convex david density detection dimensions discrimination distribution distributions estimating estimation excess fast framework hartigan highdimensional http hush ieee inform ingo kernel kernels laboratory lanl learning level levels library libsvm lindenbaum machines mammen mass measuring national networks neural nonparametric optimal other paradigm pattern platt polonik press publications rates recognition references regularized report ripley scholkopf scovel sets shawe smola smooth stat statist statistical steinwart submitted support system taylor teacher technical their theory trans tsybakov univ vector wiley with without york
http://books.nips.cc/papers/files/nips17/NIPS2004_0561.pdf	115	Hierarchical Eigensolver for Transition Matrices in Spectral Methods	academic achlioptas algorithm algorithms analysis applications approximation approximations arnoldi arpack august barnard belkin belongie bidiagonalization bisection bmvc brand canada carlo chakra chennubhotla clustering combinatorics comp computation computer computing cuts cvpr data department drawing eccv effi eigenflows eigenmaps eigenvalue eigenvectors embedding estrada extraction fast feature focs fowlkes frieze graph graphs grouping guide half http huge ieee image implementation implicitly indefinite inference infovis jepson jordan kernel kernels keyes kluwer koren lanczos laplacian large lehoucq lives lova machines malik manuscript markovian matrices matrix mclachlan mcsherry meila method methods mixture models monte multi multilevel multiscale nips normalized numerical nystrom pami parallel partitioning pothen ppsc press problems process proximity random rank recursive reduced references relaxation relocalization restarted review sampling scale science scientific scott segmentation sharon siam simon solution sorensen spatiotemporal spectral speed stats stoc survey symp techniques theorem thesis tishby toronto transition under unifying university unstructured user using view walks weiss williams with yang
http://books.nips.cc/papers/files/nips17/NIPS2004_0443.pdf	85	Methods Towards Invasive Human Brain Computer Interfaces	actuated adaptive advances analysis applications autoregressive band barnhill based biology biomedical birbaumer blankertz bogdan brain braincomputer cambridge cancer carmena channel classification classifying clinical coherence communication competition completely computer control cortes cortex cortical corticomuscular crist curio data david desynchronization deuschl device diebner dietterich dimitrov direct doherty donoghue druckrey dumpelmann during ecog edition editors electrocorticographic electroencephalography elger engel engineering epilepsies evaluation event experimental fellows filter filtering flor gene generation genista gerking gerstner ghanayim graimann grasping guyon hall hallett hand hatsopoulos haykin henriquez hinterberger huggins human humans ieee imagery imaginary imagined information instant interface interfaces interfacing international involved issue iversen john journal june kaiser kbler kernels kotchoubey kufta learning lebedev leen left lemm leuthardt levine lindemann lugger machine machines march mccane mcfarland millan mobile modeling moran motor mourino movement movements muller multichannel nature networks neumann neuper neural neurophysiology nicolelis noninvasive ojemann optimal packet pages paninski paralysed paralyzed parameters patil perelmouter pfister pfurtscheller physiologic plos potentials prentice press presurgical primates probabilistic processing protocols raethjen ramoser raven reaching recorded recordings references rehabilitation related renkens research rhythms right river robot saddle santucci sato schafer schalk schlogl scholkopf schroder sciences selection sensorimotor separability serruya signal signals single smola sons spatial special spelling statistical stolze subdural support surgical systems taub thatcher theory thought timmer toro towards trans transactions translation treatment tremor tresp trial ubingen ubler upper using vapnik vector verlag volume wavelet weibel wenzelburger weston wiley with wolpaw york
http://books.nips.cc/papers/files/nips17/NIPS2004_0190.pdf	21	Parallel Support Vector Machines: The Cascade SVM	accuracy advances after algorithm annual application artificial based bengio boser burges cambridge cascade cascades chang cjlin classifier classifiers collobert computational computer computing conference converged convergence csie data decoste detection dong each engum face fast figure forest freund from full fully generalization germany girosi guyon heap http idiap implementation improves incremental information intelligence international invariant iteration iterations joachims july kernel krzyzak large layer layers learning lecture left leipzig library libsvm lkopf lnai machine machines making margin mari measured methods middle minimal mining mixture mnist modular neural norb notes ntnu optimal optimization osuna parallel parallelization pass pattern performance perner pittsburgh platt practical press problems proc proceedings processing processor programs proximal quadratic recognition references relative report right rosenfeld running same scale separate sequential single sizes smola software solver speed springer statistical suen support svms systems tech technical theory thoz topology torch training tree trondheim tveit using vapnik vector very vision wiley with workshop york zanghirati zanni
http://books.nips.cc/papers/files/nips17/NIPS2004_0888.pdf	206	Learning first-order Markov models for control	abstract achieved acting action adaptive algorithm alternately although appendix applications approximate approximated arrival arrivals artificial assuming average based bayes bayesian because between cassandra chain chilali chosen classifiers comparison complex computational compute computer concavity consecutive control controls cover data decision decomposing decomposition degree denote departure dependencies derivation derives details dietterich different discount discounting discriminative distribution distributions domains done dynamic each ecml eldeib elements equal essen essentially experimental experiments explain factor fast finite first fixed follows fraction freedom from full function gahinet generated generative ghahramani given gives graphical have here hidden hierarchical high highest hinton horizon icml ieee imprecise included incremental independent inequality inference information initialized intelligence intelligent jair jensen john jordan justifies kaelbling kauffman kearns kneser language large larger laub lave learning learns length littman logistic lower machine mansour marginals markov matrices matrix maxq means memory method mixed mixture mixtures mode model modeling models modes more morgan naive natick neal needed nemirovski networks next nips note objective observable often ones only operations optimizes optimizing options order other over pages pairwise parameters partially pearl planning plausible pnew pomdps possible precup press probabilistic probabilities probability proc proceedings process processes processing queue queuing rabiner randomly rate rates reasoning recognition reduce references regression reinforcement remaining requirements research resp respect results reusable same satia saul scales second selected sequences service setting simpler simulations since singh slightly slow slowly sons sparse specifically speech spends springer standard state statistical stats staying steady step steps stochastic structures structuring such sufficient summation sutton switches system systems taken temporally terms than that theoretical theory these this thomas time toolbox training trajectories transition true truncating tutorial uncertain unobserved updating used using utilities value vapnik variables variants verlag very view when where which white wiley with world
http://books.nips.cc/papers/files/nips17/NIPS2004_0689.pdf	155	Approximately Efficient Online Mechanism Design	algorithm analysis andrew annual appear approach ariel artificial auctions based commerce compatible competitive conf course david decision design discrete dynamic electronic encyclopedia eolss eric fourth friedman game incentive information intelligence issue issues jackson john joint kearns large lavi learning life line machine mansour markov martin matthew mechanism michael nearoptimal neural nips nisan noam online osborne pages parkes planning press pricing proc processes processing programming publishers puterman references rubinstein sampling satinder singh sons sparse special starbucks stochastic support systems theory wifi wiley yishay york
http://books.nips.cc/papers/files/nips17/NIPS2004_0327.pdf	57	Log-concavity results on Gaussian process methods for supervised and unsupervised learning	acad academic algorithm algorithms annals applied approximate approximations aston barber bayesian bialek biometrika callan carlo chapman classification computation csato dimatteo family fourier functions gaskins gaussian generalized genovese geometry gibbs gilks good hagan halees hall ieee implementation inference integrals international iterative journal kass letters linear logconcave london lovasz mackay math mccullagh mckean microsoft miller minka models moller monte neal nelder network networks neural nips oakley pami paninski physical pillow point prekopa press probability process processes random references regression research review rinott sampling scandinavian seeger series simoncelli snyder sollich space sparse springer statistics strong systems syversveen tech thesis time toronto transactions under university vempala verlag waagepetersen wild williams york
http://books.nips.cc/papers/files/nips17/NIPS2004_0427.pdf	79	Semi-Markov Conditional Random Fields for Information Extraction	abbeel abstraction academic acapulco agichtein algorithms analysis appear applications artificial association automatic banff barabara behavior between bfgs bishop borkar borthwick bottom brunswick bunescu califf california canada cohen collective collins combining comparison computational computing conditional conf conference conll coordination corpora craven data december deshmukh dictionaries discovery discriminative distance diverse dynamic early edition editor edmonton eighteenth emnlp empirical enhanced entity entropy espinosa estimation evidence experiments exploiting extracting extraction factorized feature fields fienberg finding framework from fussell game gene generalization genome grishman guide hidden hierarchical hltnaacl human icml iiweb ijcai induction information integration intelligence international irvine janssen jersey joint journal july kaufmann kluwer knowledge koller kraut krogh labeling lafferty language large learning lerch lexicons limited limnios linguistics machine malouf management markov matching mathematic maximum mccallum mdps memory method methods metrics mexico mining models mooney morgan name named natural networks neural nocedal optimization organizational pages parameter parsing parts pattern perceptron pereira precup press probabilistic proc proceedings processes processing programming putting random ravikumar recognition records references reinforcement relational research results rohanimanesh rules santa sarawagi scale segmental segmentation segmenting semi sequence seventh shallow sigkdd sigmod simulated singh sixth skounakis sources stacked statistical sterling string structured sutton taskar tasks teams temporal tenth text theory thesis together training uncertainty university very williams with wolpert workshop
http://books.nips.cc/papers/files/nips17/NIPS2004_0237.pdf	33	Reducing Spike Train Variability: A Computational Theory Of Spike-Timing Dep endent Plasticity	abbott activity aihara among bell biol biophysical chechik coding common comp competition competitive cooperation correlated critical current cybern dayan dependent developing difference divergent editors framework froemke from gerstner gielen handbook hansel harris hebb hebbian hemmen herrmann holt homeostasis icann iconip induced influence information irregular jolivet kaynak kempter kepecs kernels learning lewis lkopf maximization maximizing methods miller millisecond model models modification moss mutual natural nature networks neural neuron neuronal neurophysics neurosci nips noise parra pfister physical physics plascticity plasticity porr postsynaptic postulate predict proc psth references reinforcement relevant response retinotectal review revisited rossum rule saudargiene saul sejnowski seung shape signals song spike spiketime spiking stable statistics stdp synapses synaptic tegner temporal themes through thrun time timing toyoizumi trains transients tter turrigiano usser vistas wagner window yields zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0763.pdf	173	Learning Gaussian Process Kernels via Hierarchical Bayes	advances algorithm algorithms allocation analysis appendix approach bakker based bayes bayesian blei borgwardt bottou breese carlin caruana chapelle chapman clustering collaborative combining complete computation computed conjoint content crcpress data defined derivatives derive dietterich dirichlet each empirical ensemble estimated extrapolation fields filtering functional functions gating gaussian gelman ghahramani greiner guttman hall harchaoui harmonic heckerman heskes hierarchical icml incomplete infinite information informative iteration jordan journal kadie kaufmann kernel lafferty latent lawrence learn learning leen likelihood machine machines manuscript meek method microsoft minka morgan multitask multivariate networks neural nystrom obtained parameters partial penalized picard platt point predictive press proceedings processing references research revised rubin rulff saul scenario schafer schuurmans schwaighofer seeger semi sets setting smola speed stands statistics step stern sufficient supervised systems task tech treat tresp unknown unpublished updated using values variables vector vishwanathan weiss where williams with zero zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0634.pdf	140	Spike-Timing Dependent Plasticity and Mutual Information Maximization for a Spiking Neuron Model	acad action activity aharonov annu approach asymmetric asymptotic bell bialek biol biophys blind brief brunel cambridge capacity cells channel checkik code coding comput computation computer correlated correlations cover cybern deconvolution dependent dynamical effects elements encoding exploiting expression factorial feedforward fisher formulations frequency gerstner gutig hebb hebbian hemmen hopfield ieee implies infomax inform information input kempter kistler learning limit linsker mathematical maximization maximizes meulen models modification multidimensional mutual nadal natl nerve network networks neural neuron neurons neurosci noise nonlinear organization outputs parga patterns perceptual phys plasticity population postulate potential prelov press proc reading recognizing reduction redundancy references relevant revisited rhythms rieke rotter ruyter science sejnowski self separation signals sompolinsky spike spikes spiking stein stevenick steveninck stochastic synaptic syst temporally theory thomas through timing trans transfer university using warland weak wiley with york
http://books.nips.cc/papers/files/nips17/NIPS2004_0776.pdf	175	Co-Validation: Using Model Disagreement on Unlabeled Data to Validate Classification Algorithms	aaai active adaptive advantages algorithm algorithmic algorithms almost approach arbitrary assuming available based bengio blake bounds braun buhmann case certain chang chapados chicago chih chung cjlin classification clustering coincide compare comparison computation consider cross csie data databases degree derived disagreement distribution drawn empirically ensemble ensembles error estimator everywhere examined extending extensions extreme fictitious fold found from future generalization generate goals granvalet http include instances journal keogh krogh kutin lange language lbrb learning library libsvm lrbb machine machines mccallum measured measures merz methods metric might model modeling network neural nips niyogi over pages paper particularly plan plentiful precision procedures recall references regression regularization repository research retrieval roth same schuurmans selection semi settings software southey stability statistical supervised support techniques test text then theory thesis this toolkit traditional transductive unbiased university unlabeled useful using validation variance vector vedelsby when where which
http://books.nips.cc/papers/files/nips17/NIPS2004_0205.pdf	27	Two-Dimensional Linear Discriminant Analysis	academic american analysis appearance applications applied approach approximations association based belhumeour california class classification comparison compression conference covariance daniel data diego dimension dimensional discriminant discrimination duda dudoit efficient eigenfaces eigenfeatures expression face fisherfaces frangi fridlyand fukunaga gene generalized gpca hart hespanha icml ieee image intelligence introduction janardan jonathan journal juyang kriegman krzanowski linear machine matrices mccarthy methods pages pattern press proceedings projection rank recognition reduction references representation retrieval scheme sigkdd singular specific spectroscopic speed statistical statistics stork swets thomas transactions tumors using weng wiley with yang zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0521.pdf	104	Probabilistic Inference of Alternative Splicing Events in Microarray Data	affect algorithm alternative arrays biology cambridge cartegni cell computational conserved durbin error exon exonic exons expression features frequently gene genome ghahramani global graphical hinton human incremental introduction jaakkola johnson jordan journal junction justifies lawrence learning listening machine mammalian measurement methods microarray microarrays model models molecular mouse mrna mutations nature neal nonsense other platform press quantitative references regulatory revealing rocke saul science silence sparse species specific splicing survey that trends understanding using variants variational view wide with
http://books.nips.cc/papers/files/nips17/NIPS2004_0628.pdf	138	Euclidean Embedding of Co-occurrence Data	academic american analysis application applications approximation becker bipartite bolker boyd cambridge chapman chechik class conference control convex correspondence criterion cvpr dimensionality discriminant editors educational embedding eugen extracting fazel fisher framework functions geometric global globerson graph greenacre griffiths hall heuristic hindi hinton hotelling image information iwata journal langford learning linear locally lond london machine manifolds math minimization minimum most multidimensional neighbor nips nonlinear obermayer optimization order pacific parametric percision predictable press proc programming psych rank reduction references relevant research rigid roth roweis saito saul scaling science semidefinite side silva stochastic stromsten structures sufficient system tenenbaum theory thrun tishby ueda univ unsupervised vandenberghe visualization weinberger when with
http://books.nips.cc/papers/files/nips17/NIPS2004_0254.pdf	37	A Topographic Support Vector Machine: Classification Using Local Label Configurations	active activity advances ages application bamford bernhard bulletin calculus cambridge cancer cell cervical classification collective college company conditional conf contours data deformable dependencies dependency discovery discriminative editors fields guestrin haykin hebert ideas image images immanent information intern issue jensen kernels knowledge koller kumar labeling lafferty lawrence learning logical lovell machine macmillan margin markov mathematical mccallum mcculloch mining modeling models multi natural nervous networks neural neville nucleus pereira physics pitts press probabilistic proc processing publishing queensland random references relational saul scholkopf screening sebastian segmentation segmenting sequence sigkdd signal smola spatial special springer statistical systems taskar techniques theory thesis thrun university unsupervised vapnik with workshop york
http://books.nips.cc/papers/files/nips17/NIPS2004_0855.pdf	197	Distributed Information Regularization on Graphs	advances algorithms also analysis approach averages blahut blum bounded capacity channel chapelle choice classification cluster combining complementary computation computational concerning conference corduneanu cover critical data distortion distributed documents effect efficiently elements exploiting extend fields found from functions gaussian general ghahramani graph harmonic here ieee implied induced inform information international introduced jaakkola july kernels labeled labelings lafferty learning loose machine markov mccallum mitchell more neural nigam nips number ought pages partially performing points possible practice preliminary principle proceedings processing propagation provides random rate rather references regions regularization regularizer results same schoelkopf semi sets settings solution sons structured suggestive supervised systems szummer text that theoretic theoretical theory thomas thrun tighter training trans twentieth understood unique unlabeled using volume walks well weston wiley with york
http://books.nips.cc/papers/files/nips17/NIPS2004_0761.pdf	171	Joint MRI Bias Removal Using Entropy Minimization Across Images	adaptive after algorithm alignment approach based beirlant bias bottom brain brainweb bright butterfly cetin collins color computer conference construction correction data denoising densities design developing digital display dudewicz effect entropy estimates estimation evans example figure fisher from full grimson gyorfi haker holmes http ieee image images imaging infant information institute international ipmi jolesz journal kabani kikinis kollokian learned learning like machine massachusetts mathematical matsakis matter maximization mcgill medical meulen middle miller mulkern must mutual nonparametric normality note notice original overview pattern phantom preferably preserved probability proceedings realistic recognition references removal repressed research royal same sample sciences segmentation series shared sharing single sled society spacings statistical structures technology tempany test that thesis this through transactions transforms unified using variational vasicek viewed viola vision volume well wells white willsky with zijdenbos
http://books.nips.cc/papers/files/nips17/NIPS2004_0026.pdf	0	Convergence and No-Regret in Multiagent Learning	aaai adaptive advances adversarial agent agents alberta algorithm amir andreu annual artificial ascent auer bandit beliefs believing bianchi boutilier bowling caroline casino cesa chang claus colell collaborative computer computing conference convergence convex cooperative correlated craig david department dynamics econometrica eighteenth eleventh equilibrium ercal extragradient fictitious fifteenth finding foundations framework freund gambling games general generalized gondek gradient greenwald gunes hall hart infinitesimal information intelligence international jafari junling kaelbling kearns keith korpelevich leading learning leslie littman machine mansour manuela markov martin matecon method michael multi multiagent nash national neural nicolo online other pack pages peter play playing points problem problems procedure proceedings processing programming rate references regret reinforcement report rigged robert role saddle satinder schapire science sergiu simple singh sixteenth spring symposium systems technical theoretical twentieth uncertainty university using variable veloso wellman workshop yishay yoav zinkevich
http://books.nips.cc/papers/files/nips17/NIPS2004_0657.pdf	144	Saliency-Driven Image Acuity Modulation on a Reconfigurable Silicon Array of Spiking Neurons	academic acuity address adlerstein advanced advances alamitos analog analysis andreou anniversary application applied arbitrated areas array attention attentionbased auditory avlsi based becker between biomorphic biophysics bishop blocks boahen boston california cambridge cauwenberghs cells center centered chip chips circuitry circuits clarity coded communications computation computer conference connectivity considerations culurciello cummings deiss delbruck dependent deweerth dietterich digital domain douglas dynamic etienne event events fast fieldprogrammable figure fire firing fovea foveation from generation ghahramani gillespie goldberg higgins high horiuchi human icecs ieee ifat image imager implemented indiveri information infrastructure input inputs institute integrate intelligence iscas itti kluwer koch kramer lazzaro location lower maass machine mahowald mallik maximum microneuro model modulation morris motion multi nature network networks neural neurobiology neuromorphic neuron neurons niebur obermayer orientation output overlapping oxford pasadena pattern peripheral peripherals philipp pixel pixels plasticity point press probabilistic proc processing processors project publishers pulse pulsed range rapid rate receive reconfigurable references research resolution saliency scene second selective sensor shifts shown silicon single sivilotti society solid space spatial spike spiking stage state stereoscopic submitted surrounded synaptic system systems technology tenore that thesis thrun timing towards tracking trans transceiver ullman underlying university using vancouver vision visual vlsi vogelstein wawrzynek weighting whatley where wills wiring with york
http://books.nips.cc/papers/files/nips17/NIPS2004_0866.pdf	199	Joint Tracking of Pose, Expression, and Texture using Conditionally Gaussian Filters	aaron advances alexander andrieu application artificial baker bayesian blackwellised brand bregler carlo chen christoph computation computer computing conditionally conference constraints contr cvpr doucet dynamic filtering filters flexible flow framework freitas from gaussian geoffrey ghahramani godsill hertzmann hinton iain image information intelligence international iterative joint journal kalman kanade kumar learning lett lorenzo lucas matrices matthews methods mixture modeling models monte motion murphy networks neural nonrigid objects observed pages partially particle press proceedings processing random rank recovery references registration rigid russell sampling schuppen sequential shape simon space state statist statistics stereo switching syst systems technique torresani tracking uncertainty unifying variational vision volume with yang years zoubin
http://books.nips.cc/papers/files/nips17/NIPS2004_0540.pdf	111	Semi-supervised Learning on Directed Graphs	above addition american analysis anatomy approach artificial authoritative automatic belkin berlin bollacker bousquet brin broder categorisation categorization chakrabarti chung citation citeseer coetzee colt communities completes composite computer conf conference consistency craven cristianini dean digital ding dipasquo engine enhanced environment equality expand extract fields finding first flake framework freitag from functions gaussian ghahramani giles global graph graphs harmonic have heidelberg henzinger hits husbands hyperlinked hyperlinks hypertext hypertextual icml identification ieee indexing indyk information intelligence intl into joachims journal kernel kernels kleinberg knowledge kondor kumar lafferty large lawrence learning lempel libraries link local machines maghoul mathematical mathematics matveeva mccallum mitchell moran national nigam nips niyogi number olkopf organization page pagerank pages partitioning proc proof proposition raghavan rajagopalan references regional regression regularization related rewritten right salsa scale search second self semi series shawe sigir sigmod simon site slattery smola society sources spectral springer stata statistical stochastic structure substituting supervised symbolic system systems taylor term theory this tomkins transactions transductive transformed unified using vapnik verlag weston wide wiener wiley with world zhou
http://books.nips.cc/papers/files/nips17/NIPS2004_0627.pdf	137	Blind one-microphone speech separation: A spectral learning approach	academic account acknowledge acknowledgments always analysis approach approximate assume audio auditory avoid bach belongie blind bregman brown bump channel chung closed clustering communication complexity component computational computer consideration cooke corporation cuts data details discriminative eccv ellis envelope estimate estimated estimation exhaustive explicit extension extensions extractors feature features fellowship form found fowlkes francis frequency from function further given gold graduate grant grid halving harmonic have helpful helps hence hidden however hyvarinen icassp ieee image indefinite independent intel jang john jordan karhunen kernels kisilev knowing known language learning linear listeners look main malik mallat many markov masking maximum method microphone microsoft minimize mixtures models morgan multinode multiple music necessary nips normalized note number nystrom observational obtained only organization other over pami paper partitioning pearlmutter perception perceptual periodicity pitch pitches press probabilistic problem proc processing provide reason reasons recursively references related relatively removing representation research respect rickard robust roweis scene search seen segmentation separation several shapes siam signal signals since single situations smoothing smoothness solution sons sound source sources sparse speaker speakers spectral speech spline strengths support take that their them this timbre time tour tracking traditional training trans used using voiced wahba wavelet where while wiley will wish with yilmaz zeevi zibulevsky
http://books.nips.cc/papers/files/nips17/NIPS2004_0362.pdf	66	Using the Equivalent Kernel to Understand Gaussian Process Regression	academic additive agnan algorithms annals chapman computation data edition editor generalized girosi graphical halees hall hastie hill interpolation jones jordan kernels kluwer laboratory learning mcgraw memo models neural nips numerical opper pages papoulis poggio press probability processes random references report scholkopf silverman smola sollich spatial springer statistics stein stochastic tech third thomas tibshirani variables verlag vivarelli voorhees williams with york yuille
http://books.nips.cc/papers/files/nips17/NIPS2004_0292.pdf	47	Heuristics for Ordering Cue Search in Decision Making	account accuracy adaptive addition algorithm algorithms also american amortized analyses appeal application apply assessing assumption attractive automatic bargain become beginning behavior bentley best betting bettman block blocks bounded building cambridge case cognition cognitive communications compared complex computer considering construction costs czerlinski decision decrease easy empirical enable environmental estes example exemplars experimental explanations factors fast fishburn frequency from frugal full fundamental gain generic gigerenzer giving goldstein good group hasher have heuristic heuristics human inference influence influencing information inspired intelligence into johnson journal juslin knowledge lazy learning lexicographic like load look lose make maker making management mcgeoch mechanism mechanisms memory might model models more necessarily necessary newell occurrence only order orders organizing overall oxford payne perform performance persson plausibility press priori probabilistic probabilities probability probex processing proposed psychological psychologist psychology rationality reason reasonable reasoning references research rest review rivest rules science search seems self sequential shanks shows side simple simplicity slight slightly smart some structure such surprised survey take than that their theorists they through todd toolbox university utilities validities validity very were what when with work working worse york zacks
http://books.nips.cc/papers/files/nips17/NIPS2004_0277.pdf	45	Limits of Spectral Clustering	academic advances algorithm anal analysis annual anselone appl application approximation artificial available balancing belkin berlin bisection bousquet case chapelle chatelin classification cluster clustering clusterings collectively colt compact comput computer conference consistency convergence department dissimilarity draft driessche dynamic eigenvectors element empirical fields finite foundations functions gaussian ghahramani global good graphs guattery hall harmonic hartigan http icml improved information intelligence international jordan journal kannan kato kernels labeled lafferty learning linear load local luxburg manifold matrix means meila meshes miller neural niyogi normalized operator operators pages parallel partially partitioning perturbation planar pollard prentice press proceedings processes processing quality random references report roose samples scholkopf science segmentation semi separators siam similarity spectral spielman springer stat statistical statistics strong structure supervised symposium systems technical teng theory thesis tuebingen unifying university using vaart vempala vetta view vision walks weak weiss wellner weston with works workshop yale zhou
http://books.nips.cc/papers/files/nips17/NIPS2004_0869.pdf	201	An Information Maximization Model of Eye Movements	academy accrual active acuity adler advanced aitesbaomo allocation analysis attention bahill barcelona based behaviors beutter brady brainard burr buswell caspi castelhano chicago chips computer concurrent conference control cortical course covert crowding decisions degrees description detection down during eckstein explain framework from geman guiding have henderson hooven human ideal ieee image images information insights intel international investigative itti jedynak journal kadir klein klitz koch learning legge less levi look machine magnification magnitudes magnocellular malik mansfield maximization mcpeek mechanism model modeling morrone most movement movements nakayama naturally nature neural niebur nothdurft noton object observer occurring oliva ophthalmology overt parkhurst pathway pattern people perception pictures plenum press proceedings processing psychophysics reading references renninger research roads role ross saccades saccadic salience saliency salient satellite scale scanpaths science search selective sequential shifts skavenski spain spatial stark suppression systems targets task testing theoretic time tjan toolbox torralba tracking trans understanding university vernier vision visual yarbus york
http://books.nips.cc/papers/files/nips17/NIPS2004_0859.pdf	198	Identifying protein-protein interaction sites on a genome-wide scale	aaai acids algorithm analysis approach apweiler article artificial bank based bayesian belief berman bioinformatics biology body bound caffrey cellular cerevisiae chain chakrabarti chen comprehensive conformations conserved correlated data database dempster deng diagnostic discovering displacement dissecting docking documentation domain domains drosophila expression falquet families febs frame freeman from function functional gene generalized genetics genome genomes genomic giot gray henrion incomplete inferring info information inst integrated intelligence intelligent interacting interaction interactions interfaces interpro janin jansen journal kaufmann koller laird large lett likelihood local margalit markers maximum mehta melanogaster methods mewes mips molecular more morgan nature nets networks nips nucleic nucliec ofran optimization pages pathways pearl pfeffer predicted predicting probabilistic probabilities proc propagation prosite protein proteinprotein proteins reasoning recognition references research resource rest rigid rost rubin saccharomyces science search segal sequence sequences side signatures simultaneous sites sprinzak stat status structure studying suppl surface systems than tool uetz uncertainty very wang weiss with xenarios yedidia
http://books.nips.cc/papers/files/nips17/NIPS2004_0089.pdf	4	Class-size Independent Generalization Analsysis of Some Discriminative Multi-Category Classification Methods	advances algorithmic american analysis annals application association audio available based behavior bernhard bounds cambridge carlos category chen class classification collins computation consistency convex crammer daphne data discussion distribution editors estimation free guestrin holloway html http ieee implementation information iwpt journal kernel koby koller large lawrence learning leave machine machines margin markov mcollins methods michael microarray minimization models multi multicategory multiclass networks neural parameter parsing people practice press princeton processing publications radiance references report research risk rockafellar ronald rosenfeld royal satellite saul scholkopf sebastian singer smoothing some speech stanley statistical statitics support survey systems taskar technical techniques theory thrun tong trans tyrrell university vector wahba watkins weston with yoram zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0603.pdf	128	Who's in the Picture?	advances airport alpes analysis anniversary appearance application applications approach association automatic baker barnard based belhumeur belongie berg blanz blei blobworld blur bontcheva carson chung class clustering cohn component computation computational computer cunningham december detector development duygulu edwards eigenfaces eigenvalue empirical environment evaluation expectationmaximization face faces failed february fisherfaces fitting forsyth fowlkes framework freitas gate geometric graphical greenspan gross grouping hespanha html http ieee image indexing information inria intelligence issue jeon jordan journal july kernel kriegman lavrenko learned learning lightfields linear linguistic linguistics machine machines maire malik manmatha matching matthews maynard meeting method methods mikolajczyk miller model modeling morphable muller names neural news nonlinear nystr nystrom pattern philadelphia pictures privacy problem processing projection querying recognition references report research rhone robust scanner scheeres scholkopf seeger segmentation semantics smola special specific spectral speed statistical systems tablan template third tools tpami transactions using vadis vetter vision wang white williams wired words workshop
http://books.nips.cc/papers/files/nips17/NIPS2004_0270.pdf	42	Harmonising Chorales by Probabilistic Inference	able above account acknowledges acknowledgments acoustic additional advances advantages affected aisb algorithm algorithms allan also amnuaisuk analysis another approach automatic bach baroque based bass beats benefit better between biological cambridge ccrma chain chorales chords closer comparison computation conditional conference considers constrained constraints correlated could counterpoint creativity crfs current data december depend descending described dimension discriminative distributions does durbin each eddy edinburgh editors especially evolution evolutionary example explored feature features feulner fields four from general genetic given gradus gratefully harmonet harmonic harmonie harmonies harmonisation harmonisations harmonising harmonization harmonizing harmony have hidden hierarchy hild hmms however icassp icml ieee including incorporated informatics information interesting intervals into jaist japan japanese johann journal kaufmann kawakami keep krogh labeling lafferty learning line linear lines lippman major make markov master mccallum mcintyre mellish melodies menzel microsoft might minor mitchison model models moody more morgan movement movements music musical natural naturels neural nishimoto note notes notion only ornamentation other output pachet pages paris parnassum part parts pereira phon piece ponsford position prediction predictions preferred press prevent principes probabilistic probability problem proc proceedings process processing properties rameau random range recognises reduite references report research result rule sagayama school schottstaedt science sebastian segmenting sequence sets should signature since society some species stanford statistical step stressed stresses studentship style sugawara support survey symposium system take taking technical texts than that their theory these thesis three through thus time together touretzky traite university used using vector vienna voice voices volume well when wiggins with within woodland words would
http://books.nips.cc/papers/files/nips17/NIPS2004_0195.pdf	23	Support Vector Classification with Input Data Uncertainty	aaai alternating analysis annual applications applied aspects bezdek bhattacharyya classifying comput computational cone conference convergence data editors formulation frontiers ghaoui golub hansen hathaway huffel john journal learning leary least lebret loan machines mathematics matrix menlo missing neural nips numerical optimization order pages pannagadatta parallel park philadelphia press problem problems proceedings programming references regularization rigorous robust scholkopf second siam smola solutions sons squares statistical support theory tikhonov total uncertain vandewalle vapnik vector warmuth wiley with york
http://books.nips.cc/papers/files/nips17/NIPS2004_0247.pdf	36	Neural network computation by in vitro transcriptional circuits	acad acids ackers arbib biochem biochemistry biol biological biophys biosystems brain bray buchler bull cantor circuits cold coleman collins computation dirks elowitz evolvable gardner genet genetic gerland gieger glass hammes handbook harb hasty hopfield ieee issacs jacob kauffman kinetics leibler lilley maass machines martin math mcculloch mcmillen mills mironov mjolsness monod nature networks neural nucleic nudler pierce pitts platzman press proc programming quant reed references reinitz research science sciences sharp shea spring symp systems tank theo theory thermodynamics trans trends wiley winfree yuille yurke
http://books.nips.cc/papers/files/nips17/NIPS2004_0139.pdf	13	PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data	abound acad algorithm algorithms alon ambroise analysis appeared arrays artificial attributes authors barkai barnhill based basis bayesian bednarski bias bioinformatics bounds broad cancer central class classification clustering colon colt covering cristianini data david discovery duffy embryonal expression extraction framework furey gaussian gene generalization gish golub guyon haussler http hunch inductive intel irrelevant john journal langford learning levine ligence linear littlestone machine machines mack many marchand mario matthias mcallester mclachlan microarray model molecular monitoring more natl nature nervous normal notterman oligonucleotide outcome patterns pnas pomeroy practical prediction priliminary probed proc proceedings processes projects quantifying quickly reasearch references research revealed samples schummer science seeger selection shawe slonim some stochastic support system tamayo taylor theorems theory threshold tissue tissues tumor tumour tutorial using valiant validation vapnik vector version weston when ybarra
http://books.nips.cc/papers/files/nips17/NIPS2004_0121.pdf	10	Neighbourhood Components Analysis	algorithm annual based bentley best carmel chen classifier comp computation conference dimensionality distance equivalence eugenic expected face finding finkel fisher friedman functions graph hertz hillel ieee information international jordan kernel koren learning liao linear logarithmic lowe machine matches measurements metric multiple neural pages pattern problem problems proc processing recognition reduction references relation robust russell sample shental similarity size small solve system systems taxonomic time trans using variable weinshall which xing
http://books.nips.cc/papers/files/nips17/NIPS2004_0676.pdf	153	VDCBPI: an Approximate Scalable Algorithm for Large POMDPs	aaai aberdeen acapulco acting advances aips algorithm anytime appear approximate artif australia automation based baxter belief bounded boutilier braziunas breckenridge canada cassandra compact compression compressions computing conf controllers decision directed domains dynamic environments exact exponential factored family fast feng finite functions gordon gradient guestrin hansen ieee ijcai incomplete incremental information intel internal intl iteration jose kaelbling koller learning linear littman local machine madison mdps method methods meuleau mexico neural nineteenth norm observable optimal orleans parr partially peshkin pineau planning point policies policy pomdp pomdps poole portland poupart proc processes processing programming projections providence pruning references representation representations robot robotics scaling search searching seattle simple solving spaan space spain state stochastic stockholm sydney systems thrun toledo uncertainty under using value vancouver vlassis wisconsin with wkshp zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0330.pdf	58	Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning	accuracies accuracy advances align alignment american atheism averaged bartlett best boldface boyd cambridge carnegie cell chapelle chung classes classification cluster colt compares conf conference convex cristianini datasets determined diffusion digits discrete each elisseeff error field fields from functions gaussian ghahramani ghaoui given graph graphs harmonic icml improved information input international isolet jaakkola jordan journal kandola kernel kernels kondor labeled lafferty lanckriet learning level linear lower machine markov mathematical mathematics matrix mellon neural nips numbers optimization order other over paired parentheses partially press proc processes processing programming quadratic random references regional regularization religion report research rows scholkopf scores seconds sedumi semi semidefinite series shawe significance size smola society spaces spectral standard supervised systems szummer table target taylor technical test theory time times training trials university upper using vandenberge volume walks weston with yalmip
http://books.nips.cc/papers/files/nips17/NIPS2004_0690.pdf	156	A Large Deviation Bound for the Area Under the ROC Curve	accuracy accurate advances agarwal algorithm allows alternative application apply area artificial average becker bipartite boosting bound boundaries bounded cambridge cannot chosen classes classical classification classifiers cohen combinatorics combining comparison confidence convergence corresponding cortes could crammer criterion curve decoupling dependence derived deriving deviation devroye dietterich differences distribution distributionfree editors efficient error estimate evaluation example expected expressed extended finite formal free freund from function functions generalisation ghahramani gine graepel gyorfi have herbrich hill hoeffding independence independent inequality information intelligence international iyer journal large larger learned learning lugosi machine margin mathematical mcdiarmid method methods minimization mohri more neural obermayer obtain obtained optimization order ordinal pages parallels pattern peled pena possible powerful pranking precision preferences press probabilistic problem proceedings processing quantity random rank ranking rate rayner recognition references regression required research result results retrieval roth route sample saul schapire scholkopf setting sigir similar simple since singer size specialized springer springerverlag statistic statistics suggests surveys systems test than that theory therefore things thrun under uniform union university used variables verlag with workshop york zaragoza
http://books.nips.cc/papers/files/nips17/NIPS2004_0208.pdf	28	Efficient Kernel Discriminant Analysis via QR Decomposition	academic aistats algorithm analysis anouar approach baltimore based baudat belhumeour beyond california class classification component computation computations decomposition diego dimension discriminant discriminants edition effective efficient eigenfaces eigenvalue face feature fisher fisherfaces foundation fukunaga generalized golub hespanha hopkins huang icpr ieee improved incremental introduction janardan johns kernel kernels kriegman kumar learning linear loan machines mathematical matrix mika modified muller networks neural nips nonlinear optimization optimized pages park pattern press problem proceedings processing programming projection ratsch recognition reduction references regularization schokopf scholkopf selection sigkdd signal smola specific statistical support theoretical third tpami training university using vector vectors weston with workshop xiong zhao zheng
http://books.nips.cc/papers/files/nips17/NIPS2004_0704.pdf	159	Contextual models for object detection using boosted random fields	additive adelson advances annals approach ashenfelter boosting borenstein bulatov carreira class classification computer conditional conf contextual data detection dietterich discriminative down estimation european features fields fink forest framework freeman friedman gradient graphical guestrin hastie hebert humans ieee image influence info interaction intl jones koller kumar labeling labelling lafferty learning logistic machine machines margin markov materials mccallum miguel model models msri multiscale murphy mutual networks neural nonlinear object objects overview pages pattern perception pereira perona perpinan probabilistic proc random real recognition references regression relating richard robust scenes schapire seeing segmentation segmenting sequence specific spie statistical statistics stuff systems taskar tibshirani time torralba training tree trees ullman using view viola vision volume workshop xuming zemel
http://books.nips.cc/papers/files/nips17/NIPS2004_0317.pdf	53	Object Classification from a Single Example Utilizing Class Relevance Metrics	ability academic algorithms amit analysis angles appear ballard based batch belongie bianchi boosting caputo cardinality categories cesa chanagizi character color complexity computer conconi cvpr database densities detection diego discriminant distance efficient enables encoding equivalence example examples exploiting family features fergus fink fisher freeman from fukunaga functions future geman generalization generative gentile graf hazan hertz hillel holistic hopkins huji iccv icml ieee ijcv implications indexing information invariant johns kernel kernels kluwer krempp latin lcvpr learn learning letter levi line local localized lowe malik matching matsakis metrics mika miller model models muller multiclass murphy networks neural nips number object online over parts pattern perception perceptual perona pratt press principal proc procedures processing pseudo publishers puzicha ratsch recipe recognition redundancy references relations report representations reusable review scale scholkopf sequential sets shalev shapes shared sharing shashua shental shimojo signal singer small statistical swain systems tech technical theory threading through thrun torralba training transactions transforms under using varying vectors viola vision visual wallraven weinshall weston with wolf workshop writing
http://books.nips.cc/papers/files/nips17/NIPS2004_0724.pdf	166	Intrinsically Motivated Reinforcement Learning	abstraction abstractions adaptive animal animals animats application artificial autonomous balkenius balleine barto based behavior berthouze between bonuses boredom building bullock cambridge chentanez cognitive collections competence concept conference control controllers curiosity dayan develoopment development developmental discovery discrimination dopamine dynamic edinburgh editors environment epigenetic first framework from generalization harada hierarchical icdl icml implementing instrumental integrated intelligence interaction international intrinsic intrinsically introduction invariance journal kakade kaplan kaufmann know kozima lajolla learning lever lund massachusetts mateo mcclelland mcgovern mdps mental mitchell model modeling morgan motivated motivation motivational networks neural neuron neurons neurophysiology neutral nips nokes oudeyer pages pentland policy possibility precup predictive press prince principles proceedings programming properties psychological putatively reconsidered reed references reinforcement reinforcing review reward robotic robotics robots russell schmidhuber schultz science scotland semi shaping signal simulation singh sixteenth skills sporns stimuli stockman stojanov studies sutton systems task temporal thelen theory thesis third transformations under university visual wang white with workshop
http://books.nips.cc/papers/files/nips17/NIPS2004_0591.pdf	124	Synergies between Intrinsic and Synaptic Plasticity in Individual Model Neurons	abbott adapt analysis anti approach baddeley bell biological blais blind booth changes coding component computation conductances cooper cortex cortices cybernetics deconvolution decorrelation dependent driven during encoded engram environments excitability experience extraction feature field firing foldiak formation forming freeman gallant general hebbian hochreiter hyvarinen independent inferior information intrator intrinsic koch learning like linden local lococode london maximization maximize natural nature neural neuronal neurons neuroscience nonlinear other primary proc processing rate receptive references representations responses reviews rules scene scenes schmidhuber science sejnowski sengpiel separation shouval side signal sparse stemmler temporal through vinje vision visual voltage zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0071.pdf	3	Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments	actions adaptive advances adversarial advice alamitos algorithm annual armed auer bandit behavior bianchi books cambridge casino cesa combine computation computer economic environment expert farias files foundations freund gambling game games http ieee impact information littlestone majority megiddo multi multiplicative neural nips novice papers playing press problem proc process references rigged saul schapire scholkopf science society symp systems thrun using warmuth weighted weights when
http://books.nips.cc/papers/files/nips17/NIPS2004_0479.pdf	92	Using Random Forests in the Structured Language Model	acoustics algorithms amit analysis annual applications backing bahl barcelona based berkeley bigram breiman brian brown california cambridge chapman chapter charniak chelba chen ciprian classification clustering communication computation computer conference constructing decision department empirical eugene european forests france frederick friedman geman gerasimos goodman gram group hall harvard head hermann ieee immediate improved intelligence international jelinek joshua july kneser language letter liermann machine martin massachusetts meeting mercer method methods model modeling models motivations natural neural october olshen parsing pattern peng potamianos predictive probabilistic proceedings processing providence quantization random randomized recognition references regression reinhard roark robust science shape signal smoothing souza spain speech stanley statistical statistics stone structured study subspace syntactic tech techniques thesis toulouse trans transactions tree trees trigram university with word york
http://books.nips.cc/papers/files/nips17/NIPS2004_0874.pdf	203	Generalization Error and Algorithmic Convergence of Median Boosting	advances algorithms annals annual bartlett baxter boosting computational computer conference confidence david department descent effectiveness efficient explanation frean freund gesellschaftsspiele gradient improved information journal kegl learning localized machine margin mason math maximizing median meir methods montreal neumann neural predictions press proceedings processing rated ratsch references regression research robust schapire science singer statistics submitted systems tech theorie theory university using voting warmuth washington with yaniv
http://books.nips.cc/papers/files/nips17/NIPS2004_0674.pdf	152	Rate- and Phase-coded Autoassociative Memory	abbott acad also amit approach appropriately bayesian biol bionet bliss brain buzs cambridge choose comput curves cybern dayan derrida different distribution dynamics entropy ermentrout fetz find first formalism from function fundamentally gardner globally harris hippocampus hopfield ieee itself jaynes keefe klausberger laughlin learning logic lond mackay marr matched matching maximum methods modeling more mueller natl nature naturforsch nelson netw neural neurol neuron neurophysiol neurosci neuroscience optimal optimally patterns philos phys physiol place press prior probability proc recall recce references reyes rule rules scarpetta science seeking seung similar sommer statistics stimulus suggests that theoretical theory there this those thus trans treves tuning university used would zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0200.pdf	26	On Semi-Supervised Classification	acapulco active adaptive algorithm annals applications artificial banff bayesian belkin bernardo blum bohning bousquet cambridge canada chapelle chichester classification cluster cohn colt combining computation computational conf continuum corduneanu data edinburgh fields figueiredo from functions gaussian ghahramani graph graphical graphs harmonic hunter icml inference information inst institute intelligence intern jaakkola jeffreys joachims kernels koller labelled lafferty lange large learn learning less logistic mach machine machines madison manifold math matveeva maximizing mexico mitchell more multinomial neural nips niyogi objective optimization partially partitioning press prior proc processes references regression regularization relevance research schohn scholkopf school seeger semi smith smoothness sons sparse sparseness spectral stat statistics structure submitted supervised support surrogate tech text theory tipping tong training transductive transfer uncertainty university unlabelled using vector weston wiley with workshop yang zhou
http://books.nips.cc/papers/files/nips17/NIPS2004_0384.pdf	72	Breaking SVM Complexity with Cross-Training	advances advice algorithms approach asymptotic asymptotically bounds burges cambridge chang classifiers cliffs computation condensed conference cosatto cybernetics data decision devijver discovery downs edited editor editors englewood eric exact funded gates graf grant hall hans hart ieee information international joachims journal kaufmann kernel kernels kittler knowledge large learning machine machines making masters mateo methods mining morgan nature nearest neighbor neural olkopf pages part pattern peter practical prentice press proceedings processing properties recognition recogniton references research rule rules saitta saul scale scholkopf sharp simplification simplified smola solutions some sparseness springer statistical steinwart support systems thank their theory this thrun training transactions transasctions tutorial using vapnik vector verlag vladimir wilson with work york
http://books.nips.cc/papers/files/nips17/NIPS2004_0722.pdf	165	Optimal Aggregation of Classifiers and Boosting Maps in Functional Magnetic Resonance Imaging	activity aggregation allwein american andonova annals appear appl approach artificial assessment association balancing bartlett based berkeley binary blanchard blood boosting bounding bounds brain brief cereb change classification classifiers classifying clustering colt combined comparing complexities conf convergence convexity cortex department detecting dimensionality discussion distributed error flow fmri frackowiak friedman friston frith functional generalization hastie human images imaging inequalities inteligence intelligence intl introduction jordan journal koltchinskii learning lecture liddle local lozano lugosi machine magnetic margin margins mcauliffe minimization multiclass neuroimage notes optimal oracle panchenko patterns preprint prob proc rademacher rates reading reducing references regularized report research resonance risk rosset savoy schapire schoelkopf significant singer sparsity springer statistical statistics technical tibshirani tsybakov unifying vayatis visual voting warmuth
http://books.nips.cc/papers/files/nips17/NIPS2004_0691.pdf	157	Non-Local Manifold Tangent Learning	advances algorithm alignment analysers analysis analyzers automatic becker belkin bengio bishop brand cambridge chapelle charting classification cluster cohn comp component computation cowan delalleau denker denver dietterich dimensionality distance editors efficient eigenfunctions eigenvalue embedding factor fields framework functions gaussian geometric ghahramani giles global groups hanson harmonic hinton icml information invariant jaakkola kaufmann kearns kernel kernels labeled lafferty langford learning lecun linear links local locally manifold markov mateo mixtures morgan muller neural niyogi nonlinear obermayer ouimet pages paiement partially parzen pattern perception press principal probabilistic problem processing random recognition reduction references report representations roux roweis ruderman saul scholkopf science semi silva simard smola solla spectral structure supervised systems szummer technical tenenbaum thrun tipping toronto transformation univ using vincent visual walks weston windows with
http://books.nips.cc/papers/files/nips17/NIPS2004_0606.pdf	130	Synergistic Face Detection and Pose Estimation with Energy-Based Models	applied approach architecture august baluja based bengio blake boosted bottou cars caruana cascade classification computer conf conference courant cvpr delakis detection discriminative document eigenspaces electric energy estimating european example face faces facial fast features from functions garcia gesture gong gradient graphical haffner http huang human iapr ieee image images institute international invariant jones june kanade laboratories learning lecun liddell localisation loss lush machine manual mathematical method miller mitsubishi models modular moghaddam monrocq moon multi multitask network neural november object objects original pages pami part pattern pentland poggio pose proc proceedings processing rapid recognition references regression report representation research robust rotation rowley schneidermn science shum signal simple singapore sparse starner statistical sung support technical training using vaillant vector view viola vision zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0527.pdf	106	Conditional Models of Identity Uncertainty with Application to Noun Coreference	abbeel accurate advances algorithm algorithms american anaphora anniversary annual aone application applications approach approaches approximate approximately artificial association austin bansal bilenko blum boykov bunescu cardie chapter charniak chawala citation cluster clustering cohen collins combine computational computer conditional conference conll coreference corpora correlation croft cuts data database databases decision detecting detection dimensional discovery discriminative distance domain duplicate early efficient eighteenth elkan energy enhanced entity experiments extraction fast feature fields focs fortieth foundations friedman from getoor graph hale harabagiu hidden high human iccv icml identity ijcai improving independent induction information intelligence international issues journal kernel knowledge koller labeling laboratory lafferty language large learning lehnert lexicons linguistics machine maiorano markov marthi match matching mccallum mccarthy meeting methods metrics milch minimization mining models monge mooney morton naacl named names natural neural nigam nips north noun papers parsing pasula peng pennsylvania perceptron pereira pfeffer phrases pinto probabilistic proc proceedings processing random recognition records reference references relation relational report research resolution results richardella richman russell science segmenting sequence sets seventh shallow shpitser sigir sixth soon statistical submitted symposium table taskar technical technology texas text theory trained training trees uncertainty ungar university using veksler very with workshop zabih zelenko
http://books.nips.cc/papers/files/nips17/NIPS2004_0550.pdf	114	Making Latin Manuscripts Searchable using gHMM's	aaai access acoustics aderant adligat adsidue adulescentulam alessandro aligned anal analysis appear applied aspicio auct audin available based beast belongie bengio bodleian bottou brittany bunke cannot censes century certum checks clearly commonly comprehensive computer conf conference conlacrumabat consumat contain contexts corpora correctly correspond cvpr despondi dictust dies document does doli dore dynamic early estimating evangelist example exedent exspectans faciuntne fairly faithfully figure first forte four from fully furti futurum given gnatu good gospels gradient graph habet haffner handwriting handwritten have headed heus hmms horst however http ieee image imperent incerta information inquam inquit intell intellegant intellegendo intelligence international interrogaverunt interrogeraverunt jitendra kevin knight koehn laborem landvennec language largely late latin learning lecun left library line lines localized mach machine made malik manmatha manuscript manuscripts matching meam measure michi mihi models monolingual munich national neque networks nonnumquam note nunc nuptiis object obsint obtemperant offer offline online oxford pages particular pattern philipp placuit plamondon portraits precision press probabilities proc proceedings process processing produce prohibebo puzicha quae quando quem queries quicquam quid quom rath reading reasonably recall recognition references reflects response returned right samy satisfactory scholars scribes search searches second serge shape short show signal siquid speech srihari standard statistical string strings studying substrings sunt survey sustuli tangam terence text texts that this those three time training trans transactions transcribed transcription transformer translation unam unconstrained university unrelated useful using variations venit version vinciarelli vision volume warping well which with word words write
http://books.nips.cc/papers/files/nips17/NIPS2004_0645.pdf	143	A direct formulation for sparse PCA using semidefinite programming	analysis application applied based boyd cadima cambridge case choice component components computational concave cones constraints continuous convergence convex core correlations department functions graphical hastie inequalities interpretation jeffers jolliffe journal lasso lipschitz loadings matlab method methods minerva minimization modified monotone nemirovski nesterov normalization operators optimization over paper point press principal problems prox rate references regression report rotation royal saddle sedumi selection series shrinkage simple smooth society software sparse stanford statistical statistics studies sturm symmetric technical technique tibshirani toolbox uddin university using vandenberghe variational vines with working wroking
http://books.nips.cc/papers/files/nips17/NIPS2004_0063.pdf	2	Hierarchical Clustering of a Mixture Mo del	aaai annual applying artech background bayesian belief bialek biswas bottleneck buhmann cardie clustering communication computer computing conf conference constraind constraints continuous control cvpr detection diagnosis discrete distance doucet dynamic equivalence estimation fault freeman gaussian goldberger gordon greenspan hertz hierarchies hillel histogram hofmann house iaai iccv ihler image information jordan knowledge koller learning lerner lerton letters likelihood lippman machine maintaining maximum means method metric mixture modality models multi neural pages parametric parr pattern pereira perez principle principles proc processing propagation puzicha recognition references representations retrieval rogers russell schroell segmentation shalom shental slonim software sudderth systems techniques through tishby tracking unsupervised using vasconcelos vermaak vision wagstaff weinshall weiss wilsky with xing
http://books.nips.cc/papers/files/nips17/NIPS2004_0612.pdf	131	Adaptive Manifold Learning	academy adaptive advances alignment automatic brand charting computing dept dimension dimensionality donoho eigenmaps embedding framework geometric global globally grimes hessian information journal langford learning linear local locally machine manifold manifolds national neural nonlinear pennsylvania press principal proceedings processing reduction references report representations research roweis saul science scientific siam silva space state systems tangent technical tenenbaum think tools university unsupervised wang zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0604.pdf	129	Assignment of Multiplicative Mixtures in Natural Images	adams adaptive adelson america anal analysis analyzing andrews applications applied arch artificial aspects attias august baraniuk barth based bayesian bell between beyond bialek bischof bollersley brehm bubbles buccigrossi cambridge cascades cell cells characterization choi clutter code coding coefficients cohn complex components compression computation computational computer conf contour control cortical cvpr december decorrelation denoising description display distributions domain dorffner dummer dynamic econometrics edge editors einhauser emergence engle entropy extensions extracting factorial feature field filters flows framework freeman from gain gaussian gaussians generation greece grenander handbook harmonic heeger heidelberg helmut hidden higher hornik hoyer huang hurri hyvarinen icann ieee image imagery images independent info information intel invariances invariant issue japan joint jordan journal july karklin kayser kearns kobe konig kording laurenz layer leads learning learns leen lett letters level lewicki mach mallows march markov mato mcfadden mixture mixtures model modeling models muller multi mumford nadal natural nature nelson network networks neural neuroscience nonlinear normal november october olshausen optical order page pages parametric parga patt phys portilla press primary probabibility proc processing properties random receptive reduction references relations research resemble response romberg royal ruderman scale scaling scenes schreiner schwartz sejnowski self sensory sequences shiftable signal signals similarity simoncelli simple slow society solla sounds sparse special speech spherically springer srivastava stammler stat statistical statistics strela structures subspaces symposium systems temporal texture their theory thessaloniki those topography trans transforms trees turbulent turiel unifying unsupervised using vayrynen verlag videos vienna vision volume wainwright walter wavelet wavelets wegmann wiener williams willsky woods xxiv zetzsche
http://books.nips.cc/papers/files/nips17/NIPS2004_0838.pdf	192	Binet-Cauchy Kernels	alternatives amato angles annual applications arma artificial automatica bell between burges chiuso cient cock colt computational computer conference constructing contract control cortes december diffusion dimensional dimensionality discrete doretto dynamic dynamical editors effi embedding equation fast finite flach from gardiner gartner gasca graph graphs grobner haffner hardness hochschultaschenbucher icml ieee ifac information inokuchi interim international invariant jounal journal kashima kernel kernels kluwer kondor labeled laboratories lafferty laub learning lecture letter linear locally machine march marginalized martin mathematical mathematics matrices matrix matrizenrechnung method metric miccheli models mohri moler moor networks neural nonlinear notes other over pages pinkus positive positivity press principal proceedings processes processing properties rational reduction references regularization report research results roweis saul scholkopf science series sets seventh shashua signal sixteenth smola soatto software solution spectral springer states strings structures submitted subspace sylvester system systems technical textures theory time total totally transactions trees tsuda united using vapnik vidal vishwanathan vision volume warmuth washington willems wolf workshop wrobel
http://books.nips.cc/papers/files/nips17/NIPS2004_0708.pdf	160	Expectation Consistent Free Energies for Approximate Inference	adaptive advances albers algorithms alternatives anderson approach approximate approximations attias averaging bayesian becker belief berkeley bethe bishop boyd cambridge cccp christopher classification comput computation constrained convergent convex cycles david dietterich division energies engine expectation field framework francisco free freeman gaussian generalized graphical graphs heskes inference information john jordan kappen kaufmann kikuchi leen lett mean methods minimize minka modeling models morgan networks neural nips obermayer opper optimization palmer phys press probabilistic processes processing propagation publishers references saul scholkopf self semidefinite spiegelhalter structured systems tech theory thouless thrun tractable tree tresp university vandenberghe variational vibes wainwright weiss winn winther with yedidia yuille
http://books.nips.cc/papers/files/nips17/NIPS2004_0467.pdf	90	Discrete profile alignment via constrained information b ottleneck	accuracy acids alignment altschul annual applications artificial barrett based basic better bialek biol biology bottleneck brenner chandonia chothia classification common communication comparison computing conference control crooks database fernando francisco friedman generator genome gish golan hebrew hubbard identification information intel investigation israel issue jerusalem journal kaufmann lerton levitt ligence lipman local logo merops method michael miller molecular morgan mosenzon multivariate murzin myers naftali noam nucleic october pages peptidase pereira prediction press proc proceedings profileprofile protein proteins publishers rawlings references research rost sander scop search secondary sensitive sequence sequences seventeenth slonim smith structural structure structures subsequences than theory thesis tishby tolle tool twilight uncertainty university waterman weblogo william within yona zone
http://books.nips.cc/papers/files/nips17/NIPS2004_0770.pdf	174	Triangle Fixing Algorithms for the Metric Nearness Problem	acid advances algorithms amino application applications approximation atlas austin barnett becker bioinformatics buhmann censor change clustering communication comp comput computation computing constraints data dayhoff denoising dhillon distance editors evolutionary fixing going gower higham indyk information jordan kenyon kruskal laub learning linear mangasarian mathematical mathematics matrix metric miranker model muller multidimensional nearness neural nips normal number numerical obermayer optimization orcutt oxford pages parallel pariwise personal plaxton press problem problems processing programming programs protein proteins publications quantitative randomized references roth russell sage scaling scheme schwarz sciences scientific sequence series side social solutions space structure study sublinear substitution suppl symposium systems tech texas theory thrun time triangle tropp univ university vega wish with xing zenios
http://books.nips.cc/papers/files/nips17/NIPS2004_0507.pdf	98	A harmonic excitation state-space approach to blind separation of speech	accepted acoustical acoustics advances algorithm america amplitude analysis anemuller appear application applications appraoch approach approximate audio background based bell blind cardoso center channel cichocki component computation conference convolutive cosmic cstr data deconvolution decorrelation delabrouille dempster dereverberation dynamical edinburgh estimating eusipco feder figure filtering forecasting from gassiat gaussian ghahramani gharbi hansen harmonic hawaii http icassp ieee imaging incomplete independent information international jain journal kalman kinoshita kollmeier laird likelihood liklihood linear maximum mcaulay media microphone microwave mixture mixtures miyoshi model models modulation monaural moulines multi nakatani networks neural noise noisy nolta number obtained olsson oppenheim orglmeister papers parra patanchon periodicity pitch plus preprints press probabilistic proc processing quasi quateri real references representation research review roweis royal rubin salam segregation separation separtion series shumway signal signals sinusoidal smoothing snoussi society source sources space speech spence state stationary statistical stoffer synthesis systems technology time tracking trans unifying university using wang weinstein workshop world zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0533.pdf	109	Maximising Sensitivity in a Spiking Network	advances agakov agmon algorithm amari approach arunava banerjee barber beck bell blind camb circuits colleagues computation crutchfield david deconvolution dendritic deneve dependent discussions dynamics efficiently eisele fabian froemke function ganguli gerstner gradient graphical grateful hong induced information inspirational jeff kistner learning many maximization michael models modification morphoelectrotonic natural nature neural neuron neurons neurosci nihat phase plasticity press processing references segev sejnowski separation snir sophie space spike spiking such surya synaptic systems thanks theis timing tony trains transform univ variational with works zador
http://books.nips.cc/papers/files/nips17/NIPS2004_0642.pdf	142	Integrating Topics and Syntax	academy acquiring acquisition allocation american analysis arabie association bayes better blei brown cambridge carlo categories cerebral chain chapman chater classification coccaro cognitive comparing computational cortex different dirichlet distributional dumais editors english factors finch finding first foundations fractionating francis gilks griffiths hall harvard hubert icslp induction information integration jordan journal jurafsky kass knowledge kucera landauer language latent lawson learning machine manning markov mills modeling monte national natural neural neville pages partitions periods plato powerful practice predictors present press problem proceedings processing providence psychological rafferty redington references representation research review richardson schutze science scientific semantic sensitive solution spiegelhalter statistical steyvers subsytems suffolk syntactic theory topics towards university volume with
http://books.nips.cc/papers/files/nips17/NIPS2004_0187.pdf	20	An Investigation of Practical Approximate Nearest Neighbor Algorithms	aaai access advances airphoto algorithm algorithms analysis anchors annual approximate april artificial arya assn autonlab autonweb behaviour belongie bentley best beyer browsing bumptrees challenge ciaccia clarkson classification comparable compare comparison complex comput computational computer computing conference consistent constraint constrast contemp contexts corelfeatures curse darrell data database databases dataset dimacs dimension dimensional dimensionality dimensions disk distance duda dynamic earth editors efficient enable estimation excluded expect expected experimental extensions fast features finding finkel fixed forests friedman full function general geometry gionis goldstein gray gregory guibas guttman hart hashing hierarchy high highdimensional hilbert html http ichi ieee image implementation index indyk inequality information intelligence international into investigation john johnson jonathan journal katayama kaufmann kevin kleinberg kushilevitz large learning lecture less letters lindenstrauss lippmann lipschitz logarithmic machine machinery malik manjunath manuscript maps matches math mathematical meaningful method metric middle moody moore more morgan mori motwani mount mover nearest neighbor neighbors netanyahu network neural ninth nonetheless norio norm notes omohundro optimal ostrovsky pages parameter patella pattern paul piotr point polots pose practical preparata preparation press principles proc proceedings processing proximity queries rabani raghu ramakrishnan recognition references removing research results retrieval rubnet satisfying satoh scene science search searches searching sensitive september shaft shakhnarovich shamos shape shapes shin showsoftware sigact sigmod silverman similar similarity software sons space spaces spatial speace speaking sphere springer stoc strictly structure survive symposium syst systems texture them theory these thesis third thirtieth time tomasi touretzky towards transactions tree trees trevor triangle twelfth twenty ucsb uhlmann uncertainty under using vantage verlag version viola vision vivaldi vldb when while wiley with yang yianilos zezula
http://books.nips.cc/papers/files/nips17/NIPS2004_0340.pdf	60	A Generalized Bradley-Terry Model: From Group Competition to Individual Skill	advances algorithms allwein analysis annals approach artificial available bakiri bartlett becker berechnung bibliography binary biometrics biometrika block bradley cambridge chang cjlin class classification classifiers codes comparison comparisons computer correcting cortes coupling csie david davidson department designs dietterich edition editors ergebnisse error estimates farquhar generalized ghahramani hastie http hunter incomplete information intelligence jordan journal kearns large learning library libsvm lihood like machine machines margin mathematische maximumproblem method methods models multi multiclass national network neural note output outputs oxford pages pair paired pairwise platt press probabilistic probability problems processing rank reducing references regularized report research saul schapire scholkopf schuurmans science second singer smola software solla solving statistics support systems taiwan technical terry thrun tibshirani turnier unifying university vapnik vector wahrscheinlichkeitsrechnung weng wise york zadrozny zeitschrift zermelo
http://books.nips.cc/papers/files/nips17/NIPS2004_0497.pdf	94	A Three Tiered Approach for Articulated Object Action Modeling and Recognition	absolute action active adelson aherne algorithm american analysis appearance application athitsos based berg bhattacharyya boundary bowden brand changes cipolla circular classification clustering cluttered coded color computer computing conditions cootes cremers cuts cvpr darrell data design detection dimensional discontinuous discriminant distance distributed duda eccv edwards efros eigenvectors elements empirical estimating estimator event features filtering filters finger fourier freeman frequency from gaussian generalized gestures gpca hand harmonic hart hartley hastie hawkins heap histogram hogg iccv ieee image imaging inform interactions interpolation interscience invariants irani jones jordan journal julesz kernel kohlberger kybernetika laboratory language learning leichner leung lihi linear maila malik manor matching materials measure media medical metric michal missing mixtures modeling models moghaddam moment mori motion nature nips normalized object optimization pami pattern pentland perception petrov pose powerfactorization probabilistic puppetry random recognition recognizing reconstruction references rehg representation representing rockett royal sarhadi sastry satoh schnrr sclaroff segmentation series shadow shape sign similarity sinogram skin society space spect spectral spelt statistical statistics steerable stenger stork taylor textons texture thacker thayananthan their theory three through tibshirani time tomasi torr tracking trans transform tree unifying using variational vidal video view vision visual walk weiss wiley with wormholes yang zelnik
http://books.nips.cc/papers/files/nips17/NIPS2004_0565.pdf	116	Incremental Learning for Visual Tracking	adaptive adelson advances algorithms analysis appearance application articulated based basis belhumeur bergen bishop black blake brand british change changes classification component computational computations computer conditional conditions conference contour data decomposition density early editors eigenanalysis eigentracking eighth elements european extraction fleet fourth framework from function geometry golub hager hall hopkins ieee illumination image images incremental information intelligence international isard jepson johns journal karhunen kreigman landy learning levy lighting lindenbaum loan loeve machine maraghi marshall martin matching matrix missing modeling models moghaddam movshon murase nayar neural object objects online pattern pentland plenoptic possible press principal probabilistic proceedings processing propagation real recognition references regions representation robust ross roweis royal sequence sequential series seventh singular sixth society spca statistical stochastic subspace systems time tipping tracking transactions uncertain under university update using value values view vision visual volume what with yacoob yang
http://books.nips.cc/papers/files/nips17/NIPS2004_0517.pdf	102	Optimal information decoding from neuronal populations with specific stimulus selectivity	abbott activity adaptive albright analysis area batra best between bialek bonhoeffer brenner britten broaden brunel carcieri cells cerebral chapman chen circuits coarse code codes coding columnar comparison complex computation connections connectivity cortex cortical cover current curves dalva dayan decoding deneve diamond direction discharge distance domains donoghue ducom elements encoders european excess excitatory eysel features ferret fields fisher fitzpatrick from functional ganglion hatsopoulos imaging implications independent information inhibitory intracortical isolation jacobs john kang katz kisvarday kuwada largely lateral latham layer lett local localization location macaque maps martin maximizes measures mechler microcircuits motion motor movshon mutual nadal narrow nature nearby networks neural neurobiology neuroimage neuron neuronal neurons neurophysiol neurosci neuroscience nevado newsome nirenberg opinion optical oram organization orientation panzeri performance petersen petroni phys population pouget preference press primary probability properties provides psychophysical random receptive redundant references reich relation relations relevant rescaling response retinal revealed richmond roerig role ruyter sceniak science sejnowski selectivity shadlen shapley sharpen somatosensory sompolinsky sound space stanford steveninck stimuli stimulus synaptic synchrony temporal that theoretical theory thomas topography toth touryan transmission tuning usrey variable versus victor visual weliky what wide wiley with young yousef zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0324.pdf	56	Real-Time Pitch Determination of One or More Voices by Nonnegative Matrix Factorization	accurate acoust acoustics advances against agents aided ainsworth algorithm analysis applications arrival audio audiovisual auditory autonomous background bagshaw based bass becker bregman brown central chapter cheveigne coding communication complex computationally computer conference constraints contours cost database deconvolution detection digital distortion edition editors effects efficient elsevier embedded enhanced enhancement environments estimation european eurospeech extraction factorization feedback fixed formation frequency fundamental goldstein goto harmonic harmonics hiller holm icassp icslp ieee imai information instantaneous intelligent intonation irino isbell italy iterative jack june karjalainen katayose kawahara klapuri kleijn kobayashi learning lecun lines manipulation mapping matrix melody method meyer model multipitch multiple music musical nakatani nature negative neural noise noisy nonnegative nonnegativity obermayer objects optimum organization pages paliwal paltz parameter parts patterson perception perceptual perfect period periodicity pitch plante point polyphonic predominant press proc processing processor rapt real recordings reference references robust saul scene science separation seung signal signals smaragdis sound sounds spectral speech statistical synthesis systems talkin teaching technology theory thrun time tolonen tones toward tracking trans transcription usenix using verona virtanen voice wang with workshop
http://books.nips.cc/papers/files/nips17/NIPS2004_0332.pdf	59	The Variational Ising Classifier (VIC) algorithm for coherently contaminated data	adaptive advanced alaysis american analysis application applications approximation artificial baluja based bayesian belief beyond biological blake boosted cascade cbcl center computation computationally computer conf contours cover database dependence detection digital distributions efficient elements european extended face features field fields freund fundamentals geman gibbs girosi haar http icip ieee image images information intelligence jaakkola jain jersey john jones jordan journal kanade kernels kindermann learning lienhart like maccormick machine machines markov mathematical maydt mean methods network networks neural object observation optimization osuna pages pattern practice prenticehall press proc processing projects random rapid recognition references regularization relaxation relevance research restoration romdhani rowley saul scholkopf sciences sigmoid simple smola snell society sons sparse spatial stochastic support system their theory thomas tipping torr training trans transactions tutorial using variational vector viola vision visual volume wiley with
http://books.nips.cc/papers/files/nips17/NIPS2004_0140.pdf	14	A Temporal Kernel-Based Model for Tracking Hand-Movements from Neural Activities	activity aertsen algorithmic algorithms applied august based bayesian beck bergman bienenstock biggs biology black boraud brain brockwell brown cambridge carmena cell cells chapin coding concerning control cortex cortical crammer crist data decoding devices dimitrov direction doherty donoghue edinburgh eichhorn embedding ensemble ensembles experimental extraction fellows field filter filtering frank from georgopoulos grasping hand hatsopoulos henriques hippocampal hypothesis ieee implementation improves inference inferring inner instant interface isaacs jornal journal kalaska kalman kass kernel kralik kuss laubach learning lebedev local logothetis machine machines march massey mehring monkey motion motor movement movements multi multiclass natan nature neur neural neurocolt neuronal neurons neurophysiology neuroprosthetic neuroscience neurosciences nicolelis nips november oliveira pages paninski paradigm particle patil patterns place plos population position potentials prediction preparatory press primates product prothesis quirk rasmussen reaching real recordings recursive references reflects regressio rehabil report research reviews rickert rojas rotter santucci scholkop scholkopf schwartz scotland serruya shpigelman signal signals singer skills small smola spaces spatial spike spikernels spiking springer srinivasan stambaugh statistical supp support tang taylor technical theory tillery time tolias toward train training trajectory trans tutorial using vaadia vapnik vector visuomotor weber wessberg weston wilson work zien
http://books.nips.cc/papers/files/nips17/NIPS2004_0670.pdf	150	Dynamic Bayesian Networks for Brain-Computer Interfaces	academic acoustics action actions advances along ballard bayesian bayliss bereitschaftspotential bilmes birbaumer blankertz brain case classifying combining communication computer conf control cortical curio current device dornhege engg environment estimate estimation evoked features figure first flor ghanayim graphical hall hallet heumann hinterberger hoppe ieee improving information instantaneous interface interfaces interfacing international intl iverson jahanshahi kaper kiibler kluwer kotchubey learning left mcfarland measure meeting meinicke models movement movt mueller nature neapolitan networks neural open orlando pages paralyzed perelmouter post potentials prentice probabilistic processing rates ratio recognizing references rehab related relevant respectively rest review right ritter series shown shows signal single software source speech spelling state study supervisory system systems taub technology time toolkit towards trans transfer trial vaughan virtual with wolpaw york zero zweig
http://books.nips.cc/papers/files/nips17/NIPS2004_0268.pdf	40	The Convergence of Contrastive Divergences	abstracts accurate adaptive advances agakov algorithm algorithms analysis annals appear appl approximation asymptotic available based basin behaviour boltzmann bremaud carlo chains clark class computation constrained contrastive convergence course cowan decreasing densities diffusions divergence edinburgh effects electronically energy ergodicity experts failures fast fields gaussian gibbs gibbsian giles global grimmett hanson hinton hopping html http ieee inference information institute intelligence journal july kaufmann kushner learning lecture leen machine machines mackay markov markovian mateo math mathematical method minimization minimizing models monro monte morgan msande neural noise notes osindero overcomplete oxford pattern press probability processes processing products prof queues random rapidly rates references report reports representations research robbins sciences siam simulation slowly space sparse springer stanford step stirzaker stochastic stochastics systems technical times training trans transients unconstrained university verlag weight welling williams with york younes
http://books.nips.cc/papers/files/nips17/NIPS2004_0235.pdf	32	A Probabilistic Model for Online Document Clustering with Application to Novelty Detection	about advances algorithms allan also analysis annals application apply approximate aspects assignments assumption base bayes bayesian blei carbonell carlin carnobell chapman chinese cikm closely cluster clustering clusters combine conditioned conference data dataset decisions definition density detection dirichlet discovery distribution document either empirical english escobar estimated estimating estimation evalplan evaluated evaluation event explore extension family ferguson first framework freeman future gelman general generation griffiths hall hard hidden hiemstra hierarchical historical http incorporate independence inference information international investigate jordan knowledge known language lavrenko learning leek like limitation lindley line make markov meanwhile method methods miller mining minka mixture model modeled models mueller multinomial naive need nested neural nist nonparametric novelty online other over paper parameter parameters pierce plan precision previous prior priors probabilistic problems proc process processing promising rate references regression related restaurant results retrieval retrospective revisit richer robertson rubin sampling schwartz semi show sigir sigkdd simplicity smith some speech statistics stern still story study supervised systems task techniques tenenbaum tests that thesis this though tipping topic tracking tractable treated trec tribute uncertainty unigram used using validation ways well west where which wiley will with word work would yang york zaragoza zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0356.pdf	64	Implicit Wiener Series for Higher-Order Image Analysis	analysis beats biologische cambridge cliffs coding compt computation congress control dodd englewood estimation field franz gain goal hall harrison higher ifac implicit institut june kernels krieger kurtosis kybernetik learning malabar natural nature network neural neurosc nikias nonlinear order petropulu planck prentice press proc references report scenes schetzen scholkopf schwartz sensory series signal simoncelli smola solution spectra statistics structure syst systems technical theories thomson tubingen visual volterra what wiener with world
http://books.nips.cc/papers/files/nips17/NIPS2004_0872.pdf	202	Planning for Markov Decision Processes with Sparse Stochasticity	advances algorithm alto analysis anytime artificial barto bounds bradtke cambridge carnegie complexity decision dynamic estimate finds formal gordon hansen heuristic information intelligence learning likhachev loops markov mathematics mellon mero modifiable neural nilsson nips operations optimality palo papadimitriou pittsburgh press principles processing processses programming provable publishing real references report research search singh solutions systems technical that thrun time tioga tsitsiklis university using with zilberstein
http://books.nips.cc/papers/files/nips17/NIPS2004_0720.pdf	164	Beat Tracking the Graphical Model Way	acoust acoustic advances analysis artificial audio austria austrian based beat body carlo cemgil comparison computing data desain dixon doucet drum empirical estimation fast filtering filters freitas gauss godsill goto gray greengard honing iccv inference information inst institute intelligence intelligent journal kalman kappen klaas laloudouana lang learning maintaining march math maximum methods mixture modality monte moore morgankaufmann multi music musical networks neural nips pages particle patrick pearl perez plausible posteriori presented probabilistic problems processing quantization real reasoning references report representation research rhythm scheirer scientific selection sequence siam signals sounds space stat state statistical stats strain system systems tarare technical tempo tempogram through time trackers tracking transform using vermaak vienna west with without workshop
http://books.nips.cc/papers/files/nips17/NIPS2004_0665.pdf	147	Optimal sub-graphical models	algorithms annual applications approximating approximations artificial bayesian bilmes bounded chow clique complexity computational computations computer conference construct darwiche decomposition dependence dependencies dept discrete distributions dtrees elimination gavril graph graphical graphs hopkins ieee information intelligence intersection jointrees june karger kjaerulff kloks lauritzen learning markov mathematics maximum mckee mcmorris models monographs narasimhan networks optimization orders oxford pages press probability proceedings recursive reduction references removal report science separable separator separators siam springer srebro symposium tarjan technical tenth theory through topics transactions tree trees treewidth ucla uncertainty university using uweetr verlag weak width with
http://books.nips.cc/papers/files/nips17/NIPS2004_0294.pdf	48	Surface Reconstruction using Learned Shape Models	accurate active adjustment amfg analysis appearance based bishop blanz british bundle calibration cambridge capture component comput computational computer computing conf conference contours cootes curves data denmark dimensional efficient european evaluation evolution evolving face faces fast faugeras fitting fluid france from geometry gestures greece grey heads heyden ieee image implicit informatics interfaces international kahl kang keriven lecture level local london machine machiraju marching master materials mathematical mechanics merriman method methods model modeling modelling models moghaddam morphable nice notes open osher pages paragios parametric pattern pdes pfister phil points press principal principles priors probabilistic problem proc processing projection quantatitative recognition reconstructing reconstruction references regularized representations robust romdhani rousson royal science search sequences sethian shape shapefrom siggraph silhouettes skoglund solem springer stereo surface surfaces symposium synthesis taylor technical thesis thessaloniki three tipping trans transactions transmission understanding university unorganized using variational vetter view vision visualization volume walker washington wheeler with without workshop zhao
http://books.nips.cc/papers/files/nips17/NIPS2004_0442.pdf	84	A feature selection algorithm based on the global minimization of a generalization error bound	adaptive advances alain algorithms andre based bayesian becker bernhard bounds boyd cambridge canu chapelle classifiers conference convex criteria cvxbook data descent discovery editors elisseeff fast feature function fung generalization glenn gradient grafting grandvalet html http incremental information international james jason journal kernel kevin knowledge lacker learning lieven linear machine machines mangasarian march massimiliano meir methods mike mining mixture models mukherjee neural norm obermayer olivier optimization pages perkins poggio pontil press proceedings processing rakotomamonjy references research sayan scaling scholkopf selection sigkdd simon sixth space stanford stephen support svms systems theiler thrun tipping tomaso university using vandenberghe vapnik variable vector vladimir weston with zero zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0819.pdf	186	0-norm Minimization for Basis Selection	academy adaptive affine algorithm antennas arrays atomic basis bayesian beamforming best california chen computing data decomposition delgado department design dictionaries diego donoho elad figueiredo focuss from general gorodnitsky ieee information january jeffreys jeffs journal kreutz leahy learning limited machine march maximally methodology minimization minimum national neural nonorthogonal norm optimally prior proc processing propagation pursuit reconstruction references relevance report representation research results saunders scaling sciences scientific selection siam signal some sparse sparseness systems technical tipping transactions university using vector weighted wipf
http://books.nips.cc/papers/files/nips17/NIPS2004_0264.pdf	39	The Rescorla-Wagner algorithm and Maximum Likelihood estimation of causal parameters.	academic advances andw annual appleton approximation away black buehner california causal causality causation century cheng clark classical cognitive conditioning conference constrained covariance crofts current danks dayan diego dynamical effectiveness equilibria explaining from griffiths holyoak human induction information journal kakade kushner learning mathematical medin model motivation neural nonreinforcement pavlovian power press proceedings processing prokasy psychological psychology references reinforcement rescorla research review science shanks society space spellman springer stochastic structure systems tenenbaum theory unconstrained variations verlag versus wagner weight york
http://books.nips.cc/papers/files/nips17/NIPS2004_0663.pdf	146	Brain Inspired Reinforcement Learning	acknowledgments activity actor adaptive advances advantage agent agents algorithms also amari analysis anticipatory approximation approximators autonomous backpropagation barto basal based bases bengio biologically brain cambridge cellular cerebellum cerebral cihr combinations compare complete computation computations concurrent cone conference considered cortex critic critics dayan delayed demonstrated dependent derived difference discussions doina dopamine down doya dynamic emerging empirical explored extended family featured field foster from function functions further ganglia gradient grant greatly helpful here hidden hippocampally hippocampus improved indicate information inspired internaltional introduction inui john joint kalaska large layer layered learning learns like linear local loops machine mansour mcallester methods model models more morris mosaic multi natural navigation network networks neural neuroscience over paper partially performance plausible policy possible potential precup presented press proceedings processing programming properties pure quasi receptive references reinforcement remains reproduces research response responses results rule scale scenes schultz sejnowski showed signal simple singh slowing some space spatial spatiochromatic stone strong structure structures such supervised supported suri sutton system systems task tasks team temporal test thank that them theoritic they this tsitsiklis tter under units unsupervised using value variety wachtler were what whiteson wickens with yoshua
http://books.nips.cc/papers/files/nips17/NIPS2004_0514.pdf	101	Analysis of a greedy active learning strategy	active algorithm algorithmic algorithms analysis angluin anthony applications approximation artificial bartlett based baum bjorner cambridge classification cohn collaborative combinatorial combining committee computational computer concept conference dasgupta data dependent employing error fields fifteenth filtering freund functions gaussian ghahramani harmonic hierarchies human icml ieee information intelligence international introduction johnson joint jordan journal kearns koller lafferty lang learning long machine matroids mccallum minimization models networks neural nigam optimal oracle oriented over pages pool poorly press problems proceedings queries query reduction references research revisited risk sampling sciences selection selective semi seung shamir shawe statistical structural sturmfels supervised support system taylor text theoretical theory through tishby tong toward transactions twelfth twentieth university used using vazirani vector vergnas when white williamson with work workshop ziegler
http://books.nips.cc/papers/files/nips17/NIPS2004_0364.pdf	67	Learning Preferences for Multiclass Problems	adapting advances aiolli algorithmic algorithms annual approach artificial based categorization category chapter classification codes computational computer conference constraint crammer dekel dept design duda editor embeddings esann facto family hart http ijcai information intelligence international joint journal label large learnability learning linear machine machines manning margin methods mika models multi multiclass neural oles online output page pages pattern peled pisa polychotomies press problems proceedings processing prototype ranking ratsch references regularized research retrieval roth science singer smola sperduti statistical stork support systems text theory thesis thirteenth unipi university vapnik vector verleysen watkins weston wiley york zhang zimak
http://books.nips.cc/papers/files/nips17/NIPS2004_0578.pdf	119	The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces	acapulco algorithm allen analysis andrew anguelov articulated artificial assembling attractive august automation baker belief benjamin besl black blanz body books burgard canada capture carnegie chen cheung christian chui city complex computer concurrent conf conference correlated correspondence coughlan curless cvpr data davis deformable deformation detection diffusion drago eccv efficient estimation exploring extension faces felzenszwalb ferreira filling finding freeman from garr generalizations graph gross hahnel holes http human huttenlocher iccv ieee ieeecomputer ijcai image images institute intelligence international isard johnson journal jovan kanade kinematics koller leonid leventon levoy limbed loopy loose machine marschner massachusetts matching mckay medical medioni mellon meshes method mexico michael millennium mobile model modeling models morphable motion multiple nips nonrigid object objects pages pang parameterization parametric partitioning pattern pedro people pictorial pittsburgh point popovic proc proceedings processing propagation quebec rangarajan range real recognition reconstruction recovering references registration representation rigid robotics robots rusinkiewicz sail scans science segmentation sequences shape shapes shelton sigal sigelman siggraph silhouette society space spin srinivasan stanford statistic structures sumner surface surfaces symposium synthesis technology thesis thrun time tracking transactions transfer transmission triangle understanding university unsupervised using variants vetter vision visualization volume volumetric weiss with yedidia
http://books.nips.cc/papers/files/nips17/NIPS2004_0239.pdf	35	Spike Sorting: Bayesian Clustering of Non-Stationary Data	abeles across action adams aharonbh analysis anisotropic assignment automatic bayesian bonds caltech characterization classification compensation computation cover detection dimitrov distributions during elements emondi etho fellows from gaussian goldstein http huji hungarian hypotheses ieee information john kleinfeld kuhn kurgansky lehmann lewicki logistics method methods miller mitra mixtures multiple multispike multivariate naval network neural neurocomputing neuronal neurons neuroscience normann penev physiological potentials presence problem proc quarterly rebrik recorded recordings references research review robust shapes shoham signals snider sons sorter sorting spike sslib stationarity stationary statistical systems testing tetrodes theory thomas time tracking train unit using variability wiley york
http://books.nips.cc/papers/files/nips17/NIPS2004_0809.pdf	183	Kernels for Multi­task Learning	akhiezer annual appear aronszajn artificial banach baxter belkin bias colt computation computational conf conference data david dimensionality discovery dover eigenmaps evgeniou exploiting function functions generalized glazman herbrich hilbert inductive intelligence journal kernels knowledge laplacian learning linear micchelli mining model multiple multitask neural niyogi operators pontil proc reduction references regularized relatedness representation representer reprint reproducing research scholkopf schuller sigkdd smola spaces statistical task theorem theory trans valued vapnik vector volume wiley york
http://books.nips.cc/papers/files/nips17/NIPS2004_0672.pdf	151	Kernel Projection Machine: a New Tool for Pattern Recognition	advances algorithmica analysis applied approximating approximation asymptotics baker barron bartlett based benchmark benchmarks birge blanchard boosting bounds bousquet cambridge cbms clarendon classifiers component computation conference data donoho editors eigenvalue equations evgeniou fields first http hyperrectangles implications industrial integral inversion kernel koltchinskii large macgibbon machines manuscript margin massart mathematics matrices method minimax model models muller networks neural nonlinear numerical observational operator operators over oxford pages papers pattern penalization pennsylvania performance philadelphia poggio pontil press proba probability problem progress projections raetsch random recognition references regional regression regularization relat repository risk scholkopf schuurmans selection series several smola society some spectral spline statist statistical support theory treatment used vector volume wahba
http://books.nips.cc/papers/files/nips17/NIPS2004_0528.pdf	107	Economic Properties of Social Networks	albert algorithm american amin arrow barabasi bollobas brief buyer cambridge christos clubs coalitions colt competitive debreu devanur distributions dual econometrica economic economics economy efficiency emergence equilibrium existence fisher focs formation gale generative gerard graphical graphs group hill history internet irving jackson july kakade kearns kenneth kranton linear lognormal market mathematics matthew mcgraw minehart mitzenmacher models network networks nikhil ortiz papadimitriou power press primal random references review saberi scaling science seller stability survey theory thesis type university vazirani vijay yale
http://books.nips.cc/papers/files/nips17/NIPS2004_0129.pdf	11	Incremental Algorithms for Hierarchical Classification	about algorithm algorithms appear artificial automatic bartlett bianchi bounds brain cambridge categorization cesa chang chen ciaramita cjlin classes classification classifier classifiers classifying clustering collection colt computation conconi conf conference content corpus cristianini csie data dekel documents dumais european evaluation from functions gentile granitzer graz hierarchical hierarchically hierarchy hofmann icml ieee improving information intelligence into introduction kaufmann kernels keshet koller language large learning library libsvm linear machine machines margin mccallum medir methods mining mitchell mladenic model modeling morgan networks neural nips ohsu ohsumed omnipress order organization page pages perceptron press probabilistic proc proceedings psychol rdir references regret researchandstandards retrieval reuters review rosenblatt rosenfeld ruiz sahami sampling scholkopf second selective semantics shawe shrinkage singer smola springer srinivasan statistical statistics storage support syntax taxonomies taylor technology test text theory thesis threshold toolkit turning university using vapnik vector very volume wiley williamson with words workshop yahoo
http://books.nips.cc/papers/files/nips17/NIPS2004_0372.pdf	70	A Hidden Markov Model for de Novo Peptide Sequencing	accuracy acid aebersold alex alexey amanda american amino analytical andrew approach ashley audens automated automatic baginsky biology chemistry chen chengzhi christopher church cieliebak communication computational computer correlate data database dept doherty dynamic empirical estimate eugene george gilles gruissem hendrie identifications implementation jimmy john johnson journal kaizhong keller kirby kleffmann kolker lajoie liang liptak made mark mass matthew matthias mccormack ming model muller nesvizhskii novo paolo peaks penna peptide peptides powerful programming protein rapid references report richard ruedi rush sacha science search sequences sequencing society software spectral spectrometry statistical tandem taylor technical tepel ting tool torsten uses wilhelm with yang yates zhang zsuzsanna zurich
http://books.nips.cc/papers/files/nips17/NIPS2004_0804.pdf	182	Comparing Beliefs, Surveys and Random Walks	aaai ability algorithm algorithmic analytic approach arxiv barthel behaviour boolean braunstein cient cohen computer cond critical dimacs discrete edition equations equilibrium expressions focs from hartmann homes http instability intelligent kauffmann kautz kirkpatrick local mathematics mechanics mezard monasson montanari papadimitriou parisi pearl phase phys probabilistic problem problems proc propagation random reasoning references replica ricci sati satis science search selman semerjian series solution solutions statistical step strategies survey symmetricbroken systems tersenghi testing theoretical walksat washington weigt zecchina
http://books.nips.cc/papers/files/nips17/NIPS2004_0779.pdf	176	Theories Of Access Consciousness	about abrams academy advances analysis annual associates baars basic becker behavioral biederman block brain cambridge changeux cognition cognitive colagrosso computational conference confusion conscious consciousness control cottrell covert data dehaene dietterich discrimination dissociated during eighteenth emergent erlbaum evidence farah framework function ghahramani greenwald hillsdale huber information lesioned linking long mathis meaning mechanisms model mozer naccache national network neural neuronal neuroscience objective outweigh overt parts pathway perception physiological press priming probabilistic proceedings processing property psychological rational recognition references refinement reilly repetition reports review science sciences sergent skill society speeded subjective subliminal systems task term theory towards twentyfifth unconscious university vecera visual whole word workspace
http://books.nips.cc/papers/files/nips17/NIPS2004_0677.pdf	154	A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees	adelman advantage algorithms analysis appear appeared applications applied approach approximate approximating approximation artificial athena average baird based bellmont bertsekas bounds boyan cliffs constraint control cost december decision differential direct directed dynamic edition efficient englewood equilibria error factored farias feature fixed function game garcia generalization generalized gordon guestrin hall harmon icml intel inventory iteration journal klopf koller large learning ligence linear machine markovian mathematical mathematics mdps methods moore munos neuro nips november operations optimal parr pathways patrascu points policy polynomial preliminary prentice preprint price processes programming references reinforcement research residual routing safely sampling scale schuurmans schweitzer scientific second seidman solution solutions stable stochastic tsitsiklis updating value venkataraman version volume with zangwill
http://books.nips.cc/papers/files/nips17/NIPS2004_0194.pdf	22	Result Analysis of the NIPS 2003 Feature Selection Challenge	also analysis applications artificial bagging bayesian benchmark beyond blum bonouliqui breiman call cambridge challenge clopinet competition data databases datasets december defining dept design diffusion dirichlet distributions editors elisseeff ensemble examples experiments extraction feature features forests foundations gunn guyon html http information intel introduction isabelle jmlg jmlr john kazakov kernels kohavi kremer laloudouana langley learning lecture ligence line machine machines march material methods mlearn mlnet mlrepository model modelselect murphy neal network networks neural nikravesh nips nipsfsc notes number optimization papers popelinsky predictors preparation press priors projects random references regularization relevant report repository research schoelkopf selection service skremer smola sons soton springer statistical statistics stepankova supplementary support tarare technical theory toronto trees university unlabeled uoguelph using vapnik variable vector verlag wiley with wrappers york zadeh
http://books.nips.cc/papers/files/nips17/NIPS2004_0511.pdf	99	Mass meta-analysis in Talairach space	accessed activation analysis anatomical anders andrew april area artificial arup atlas august automatic available behavior biological blair blood brain brainmap brainmaptm brede brett broca cabeza california cerebral chein claus cognition cognitive conference content context coordinates cyril data database david december delay design detection during eden elementary empirical evaluation experiments february fiez finding finn fissell flow fmri ford francisco from functional gade generation george goutte guinevere hansen heterogeneity holmes html http human ieee images imaging ingvar intel interest international jack jacobs january japan jean jones jority journal julie july june karen labeling lancaster lange lars larsen ligence lines lionel liptrot london lyngby mapping march martin matlab matthew medical medicine memory meta metabolism method mnispace model modeler modeling mrccbu nature networks neua neural neuroanatomy neuroimage neuroimages neuroimaging neuroscience nicholas nielsen nyberg olaf outliers pages pain parametric part paulson penrose peter philosophical physiology pierre planar presented proceedings publisher reading references related review reviews roberto roimaging rottenberg royal sciences sendai series single small society spatio statistic statistical statistics stephen stereotaxic strother studies svarer talairach tapped temporal thieme thomas toft toolbox tournoux transactions turkeltaub validation verbal volume volumes voting watson within word working york zeffiro
http://books.nips.cc/papers/files/nips17/NIPS2004_0617.pdf	133	Hierarchical Bayesian Inference in Networks of Spiking Neurons	about abstract abstracts adelson america anderson annual approximate areas asynchronous attention based bayesian belief brain cambridge carpenter chelazzi circuits codes cognitive competitive computation computational computations control cortex cortical current dayan decisions dendrites deneve desimone discrimination distributional doubly dynamics empirical escape essen estimation fast feature fire from function gerstner gold hausser hierarchical ieee illusions imitating inference input integrate integration intelligence intelligent interconnected interpretation jordan journal kaufmann knill kording learning lewicki life likelihood locking loopy macaque mateo mechanisms modeled models morgan motion movements multiplicity mumford murphy nature networks neural neurobiological neurobiology neuron neurons neuroscience nmda noise olshausen opinion optical optimal pages pattern pearl perception percepts plausible plesser population pouget press probabilistic proceedings propagation rates reasoning recurrent references representation review reynolds richards saccadic sahani sciences sensorimotor sensory shadlen simoncelli simultaneous society spiking states stimuli stochastic study subserve systems that transients trends uncertainty underlie university visual weiss williams with wolpert york zemel
http://books.nips.cc/papers/files/nips17/NIPS2004_0579.pdf	120	Validity estimates for loopy Belief Propagation on binary real-world networks	advances albert alternative approximate barabasi belief bethe binary bray comp complex condmat conf correctness cycles debrecen diagrams dilute emergence empirical energy erdos fixed francisco free freeman frey generalized glass glasses graphical graphs heskes inference information intelligent jordan kappen kaufmann local loops loopy mackay math mechanics minima models mooij morgan murphy networks neur neural optimization pages pearl phase phys plausible points preprint probabilistic probability proc processing propagation publ random real reasoning references renyi revolution scaling science solid spin stable state statistical study systems transitions uncertainty viana volume weiss welling with world yedidia
http://books.nips.cc/papers/files/nips17/NIPS2004_0843.pdf	194	Using Machine Learning to Break Visual Human Interaction Proofs (HIPs)	acknowledge adversarial alamitos algorithms also alto analysis anatomy applied automatically baffletext baird based benaloh bengio best between blum bottou breaking captcha chau chew clara clutter computer computing conf conference convolutional custom cvpr decomposing design differentiator difficulty discussions document done each eric even first given gradient greatly haffner hand have help hips hope http human iapr icdar ieee image images improving intelligence interactive international intervention into january josh june labeling langford learned learning lecun like machine machinery malik meltzer mind mori networks neural nowl objects observation other page pages palo paper pattern paya platt popat practice princeton problem proc proceedings project proof proofs reader recognition recognizing references requires retrieval santa security segmentation segmenting simard simplifies society solved solving spie steinkraus stimulating stronger successfully systerms tests that their them this turing unprocessed used using various versatile vision visual weaker with workshop would
http://books.nips.cc/papers/files/nips17/NIPS2004_0096.pdf	6	Message Errors in Belief Propagation	algorithm algorithms angelov appear application approximate approximating approximations association based bayes bayesian belief berlin between cetin chen clifford communication computation computer constrained constructing control correctness coughlan cvpr data decision deformable dept digital disorder distributions eccv editors energy errors estimation expecatation ferreira fields finding fisher fixed free freeman general generalized georgii gibbs graphical grimmett gruyter hans heskes hybrid ieee ihler inference information intelligent isard jordan julier kaufman koller laboratory lerner local loops loopy markov mateo mathematical mathematics measures merl message method minka modeling models morgan nets networks neural nonlinear nonparametric optimization otto oxford pages pampas pearl phase physical points press probabilistic probability proc processing propagation random real reasoning references relationships report science sensor september shapes signal statistics studies submitted sudderth systems tatikonda technical theory transformations transitions uhlmann uniqueness univ university using valued vision wainwright weiss welsh willsky with yedidia york
http://books.nips.cc/papers/files/nips17/NIPS2004_0437.pdf	81	Face Detection -- Efficient and Rank Deficient	accuracy advances algorithms analysis application applications arias audio authentication baluja based biometric blake blanchard boosted burges cambridge cascade cbcl complexity computationally computer conference constraints decision deficient designs detection edelman editors efficient face fasel fast features freund geman geometry girosi gray heisele hierarchical http ieee images improving information intelligence international january jones jordan journal kanade kernel kienzle learning library luettin machine machines matlab matrix memo methods mozer network neural object orthogonality osuna page pages paris pattern people person petsche poggio pontil press proceedings processing rank rapid rdrs rdrslib recognition reduced reducing references report romdhani rowley rules scholkopf sets siam simple simplified smith smola speed still support systems technical testing time torr training transactions universit using vector video viola vision volume with yacoub
http://books.nips.cc/papers/files/nips17/NIPS2004_0099.pdf	8	Detecting Significant Multidimensional Spatial Clusters	accordingly account accuracy acta activation activity addition adjusted adjusting advances advantages agrawal alamos alarms algorithms analysis application applications apply approach areas associative automatic balakrishnan before believe bentley binary biometry birkhauser boston brain broca bump calculations cancer carnegie case cluster clustering clusters cognitive combination comm communications comparisons composite computational computing conclusive conf conference cortex cpdc cross currently data databases datasets demographic demonstrated dense denser dept desired detail detect detecting detection different dimensional discovery disease domain domains draw each efficient enable epidemics evaluating examining experimental false fast feasible fields finkel first fisher fmri found friedman from generalized geographical given glaz goil grid have health here high however hunting images including increased informatica information intl into investigating investigation iterate keys knowledge kulldorff lancet lange large larger learning less leukemia likelihood longer loss machine mafia makes management many medical mellon meth method methods mining mitchell models moore more most multi multidimensional multiple naive nature needed neill neural northwestern openshaw other over pacifico parameter performance perone pick powerful presented press proc processing public published quadtrees random rapid rates ratio real references regions report research resolution resulting retrieval scalable scan search searching sense sets sigkdd sigmod significance significant smaller space spatial spatio speedups stat states statistic statistical statistics step sting structure studies subject subspace systems taking task technical temporal test tests that theory these this through thus time toward trees tune university used useful variety very visual waller wang well wernicke where which wiley will without world worsley
http://books.nips.cc/papers/files/nips17/NIPS2004_0839.pdf	193	Temporal-Difference Networks	abstraction acknowledge acknowledgments action adding address advances advantages algorithms allow also although anna artificial authors barto begun between boyan bradtke bulitko clear computation concerned conditional conference consider data dayan defined difference differences direction discovery doina domains dramatically dynamical eddie efficiency encouragement even experiments explore exploring expression expressive expressiveness extensive faster finally first framework francisco from fruitful fully further generalization gratefully grounded group have hierarchical ideas immediately improving information intelligence international iteration james jong journal kaelbling kaufmann kinds koop lagoudakis large learn learning least linear littman machine many mark mdps members methods michael mixture modeling models morgan most natural network networks neural nodes nonlinear note observable other over pages paper pardoe parr policy possibilities potential precup predict predictions predictive preliminary previous prieditis problem proceedings processing produces promising question rafols received references reinforcement representation representational representations research reset results ring rlai rudary russell satinder scales semantics semi setting show significant singh squares state stochastic stone successor suggest sutton systems technical temporal tenth than that them there they this thus time twelfth twentieth twenty ultimately update using vadim wang when which whose with work world
http://books.nips.cc/papers/files/nips17/NIPS2004_0622.pdf	136	Coarticulation in Markov Decision Pro cesses	abstraction action adaptive addison advanced amherst andrew architecture artificial barto boutilier brafman canada cesses classical coarticulation comp computer conf conference constrained control decision decomp department distributed dore editor edmonton eighteenth factored fagg fifteenth framework francisco geib goal gordon grasping grup guestrin hierarchical hybrid ieee intel international iros joint kaufmann khash laws learning ligence ligent lyapunov machine mahadevan markov martha massachusetts mdps morgan nakamura nullspace optimization osition pages perkins planning platt pollack precup prioritized proc proceedings redundancy references reinforcement robot robotics robots rohanimanesh science sets synthesis systems technical temporal theo theoretic thesis towards umass uncertainty university wesley
http://books.nips.cc/papers/files/nips17/NIPS2004_0460.pdf	89	Newscast EM	academic accelerated acknowledgments adaptive advances affairs aggregate algorithm algorithms amsterdam analysis another appear applicability artificial august available averaging banff barber based beach belgian belgium brussels cambridge canada cannot case chicago choice clustering comments complete component computation computed computer computing conf conference could data decentralized dempster density dept distributed distributing dobra domain dutch each economic editor editors efficient elements embedded estimation exact experiments explorations factorize finally forman foundation foundations from gavidia gehrke general ghahramani gossip graphical greedy guestrin helping hinton ieee incomplete incremental inexpensive inference information instance intelligence interesting investigate involving january jelasity jordan journal july june justifies karp kempe kluwer kowalczyk laird learning likelihood locally machine making management maximum mcsherry membership ministry mixture moallemi models more neal network networks neural newscast node nodes note november nowak nunnink observe observes october only optimization organization other over overlays pages paskin performed press probabilistic problem problems proc processing program progress project protocol publicly publishers pylak quantities quantity randomized rate redondo reduction references report requires research robust rubin rumour sample saul schindelhauer scholkopf science scientific sensor several sfakianakis shenker sigkdd signal simulator some sparse spectral spreading statist steen step study supported symp systems technical technology thank that their theory this thrun together trans uncertainty uniform universiteit unstructured useful valued variance variants vector verbeek view vlassis vocking voulgaris vrije want weighted weights when while with would zhang
http://books.nips.cc/papers/files/nips17/NIPS2004_0887.pdf	205	Learning syntactic patterns for automatic hypernym discovery	acknowledgments acquisition afosr alberta allison also analogy annotating answering approach aquaint arda assistance assumptions automatic automatically automaticsemantic badulescu based bayes better bigham brown buckley building cambridge caraballo cederberg charniak chinese choice ciaramita classes classification classifiers clustering combining committee computational computing conference conll constraints construction contract coordination corpora corpus customizing darpa data database department dependency developing diab disambiguation discovery discussions dissertation distributional electronic emnlp engineering english evaluation extraction fall fellbaum fellowship forum fourteenth france from girju granada harman hearst hierarchical hierarchy hofmann hovy huffman hypernym hyponyms hyponymy iclm ijcai improve independent inference information interior international johnson karger kayur knowledge labeled labeling language large learning lexical lexicon lexicons linguistics littman methods minipar modules moldovan mona multiple naacl naive nantes natural nbchd ndseg noun nouns number occurerence pantel parsing part patel patterns pereira phrase poor precision press problems proc program project question ranlp ravichandran recall references relations rennie riloff roark rules schutze science semantic semi sense shanyder shepherd shih sigir siglex snow solve spain sponsored statistical statistics suit supersense supported surface synonym syntactic system systems tackling tagging task taxonomies teevan text thank thesis this tipster tishby todd tseng turney under university unknown unsupervised useful using whole widdows with word wordnet words work workshop world
http://books.nips.cc/papers/files/nips17/NIPS2004_0668.pdf	148	Bayesian Regularization and Nonnegative Deconvolution for Time Delay Estimation	acoust acoustics advances allen approximation arrival assp bayesian becker berkley binaural carter cell code computation conference correlation deconvolution delay discriminative efficient emergence estimation field foresee gauss generalized hagan icassp ieee image images information international interpolation joint journal knapp learning localization machine machines mackay method multiplicative nature networks neural newton nonnegative obermayer olshausen press proceedings processing programming properties quadratic receptive references regularization relevance research reuven room saul simple simulating singer small sound sparse support suzanna systems time tipping transactions updates vector
http://books.nips.cc/papers/files/nips17/NIPS2004_0519.pdf	103	Semi-supervised Learning by Entropy Minimization	adaptive advances american amini analysis analyzing applicability artificial association based bayesian berger bousquet brand castelli classification computation conditional conf conference consistency cover data decision discriminant discrimination documents edinburgh edition effectiveness entropic european extinction fields from functions gallinari gaussian ghahramani ghani global grandvalet harmonic ieee information institute intelligence international ipmu jaakkola journal knowledge labeled labels lafferty learning local logistic machine management mccallum mclachlan mitchell mixing models navin neill neural nigam ninth normal observations pages parameter partial partially pattern press prior probability processing recognition references regression regularization relative report samples scholkopf seeger semi springer statistical structure supervised systems szummer technical text theory thrun training trans uncertainty unclassified university unknown unlabeled using value weston wiley with york zhou
http://books.nips.cc/papers/files/nips17/NIPS2004_0709.pdf	161	Chemosensory processing in a spiking model of the olfactory bulb: chemotopic convergence and center surround inhibition	achieved acknowledged acknowledgments actuators adaptation adding additional agustin alexandre allow among analogue analysis antennal anti architectures arrays attractor aungst austin award axel based between biologiacal biological biosystems bmes bulb cambridge career cell center chao chemosensor chemotopic classification coding competitive completion computation computational conference connections conscience constant convergence correct cybernetics desieno distributions driven during dynamics early efficient electronic embs emergent employs encoding extensions feature formation foundation from functions further galizia galvez gerstner glomeruli gratefully gutierrez hebbian herz hibikino hyperacuity icnn identity ieee improvements information inhibition intensity international interpretation investigate japan jayaraman journal kauer kernel kistler kohonen koskela laaksonen lateral lattice laurent learning lobe machine manuscript maps material means mixtures model models modulation molecule mori nagao national nature networks neural neuron neurons neuroscience nose nunez odor olfaction olfactory organization organized organizing orthogonalization osuna parallels part pathway pattern pearce pereralluna perspective piscataway plasticity populations preparation present press probability proceedings processing projections rapid reedy references review robust sachse science self semiconductor sensing sensors sensory signal simple single sitcheran spiking springer stimulus stopfer suggestions supported surfaces surround system systems takao temperature texas that these this through throughout topographic topologically transmission under university upon valuable vassar verlag verschure versus vosshall wermter white will willshaw work workshop yamanaka yoshihara
http://books.nips.cc/papers/files/nips17/NIPS2004_0423.pdf	77	New Criteria and a New Algorithm for Learning in Multi-Agent Systems	aamas acknowledgements activity adaptive advances against agent algorithm algorithms allocation analysis annals appear approach approximation architectures artificial autonomous awesome bayes behavior benchmark best boutilier bowling brafman brown cautious chapter claus colell combine comprehensive conference conitzer consistency contributions control convergence converges cooperative correlated critical darpa dayan decision devising distributed distribution dynamics econometrica economic economics efficient eighth equilibrium evaluating extending fellowship fictitious foster from fudenberg game games gamut general generalsum gradient graduate grant grenager hannan hart hoeffding hope implicit independent information intelligence international introduction iterative john journal kaufman kearns known languages leading learning learns levine leyton line littman machine mansour mathematical method methods modern morgan multi multiagent nash national negotiation neural note nudelman number opponents pages part perspective play plays powers press problem procedure proceedings processing production rate references regret reinforcement repeated report response risk robots sandholm self shoham simple singh solution sons stanford stationary statistics stochastic stone structure successes supported survey systems technical tennenholtz tesauro that theoretic theories theory this trials ultimately universal unknown using variable veloso vohra washington watkins weiss wiley with work workshop wortman york
http://books.nips.cc/papers/files/nips17/NIPS2004_0028.pdf	1	Large-Scale Prediction of Disulphide Bond Connectivity	abkevich about acids activity against algorithm allied analysis apweiler architectures bairoch baldi bank barnase based berman between betz bhat biochem biochemistry bioinformatics biol biology bonds bourne bridges casadio catalytic chem clarke classes comput conformational connectivity contribution damiani data database demetrius denaturation design deterministic directed disulfide editors edmond efficient eight energetics engineered engineering evolutionary fariselli feng fersht floudas folding frasconi function functional gabow genet gilliland globular graphical graphs ieee implementation improving increase increasing information intelligent issue journal kinetics klepeis klink knowledge large learning machine martelli matching math matsumura maximum method models multiple narayan nature network networks neural nucl nucleic pages pathway perpective pollastri polypeptides predicting prediction press principled probabilistic probes problem profiles prot protein proteinfolding proteins proteomics przybylski raines rate recurrent recursive references relationship research ribonuclease rnns rosen rost scale scheraga secondary sequence shankhnovich sheet shindyalov simulations special stability struct structural structure submitted substantial supplement swiss systems taylor technologies tell theor thermodynamics three topology trembl using volume vullo wedemeyer weight weissig welkler westbrook what woycechosky
http://books.nips.cc/papers/files/nips17/NIPS2004_0503.pdf	96	An Auditory Paradigm for Brain­Computer Interfaces	adaptive algorithms america analysing analysis assessing attenaa attention auditory autoregressive barnhill based behavioral biomedical birbaumer blankertz bogdan brain cambridge cancer change channel classification cognitive communications completely component computer control cornsweet decomposition delorme device disappearance distraction donchin during dynamics editor eeglab effects electrical electrophysiological engineering erlbaum event evoked fast fixated fixed flor function gene ghanayim guyon haykin hillsdale hillyard hink hinterberger human ieee imagery including independent information interface interfaces irrelevant issue iversen jects journal june kaiser kernels kohlmorgen kotchoubey kubler learning left letin lkopf lugger machine machines makeig measures menatal methods motor muller negativity networks neumann neuper neural neuroscience open optical other pages paradigm paralyzed parameters patients perelmouter pfurtscheller picton point potential potentials press processing prosthesis psychological ratliff recorded references reflection rehabilitation related research revealed riggs right rinen robust role schl schr schwent science sciences selection selective separability signal signals signs singletrial smola society sound source special speed spencer steadily support systems task test thought tion toolbox transactions translation using vapnik vector visual weston wijesinghe with wolff ziehe
http://books.nips.cc/papers/files/nips17/NIPS2004_0810.pdf	184	Conditional Random Fields for Object Recognition	class classification computer conditional conf conference contextual data discriminative emnlp entropy extraction features fergus fields framework freitag from hebert icml ieee inference information intelligent interaction invariant june kaufmann kumar labeling lafferty learning local lowe machine markov maximum mccallum models morgan networks object pages part pattern pearl pereira perona plausible probabilistic proc proceedings random ratnaparkhi reasoning recognition references scale segmentation segmenting sequence speech systems tagger unsupervised vision volume zisserman
http://books.nips.cc/papers/files/nips17/NIPS2004_0170.pdf	18	Fast Rates to Bayes for Kernel Methods	aggregation anal analysis appear appl approximation based behaviour blanchard bousquet cambridge city classification classifiers complexity consistency consistent convex cristianini devroye error estimating fast gyorfi hong http ieee influence inform ingo introduction kernel kong lanl learn learning lugosi mach machine machines massart methods minimax minimization nonparametric optimal other part pattern performance press probabilistic publications rates recognition references regularized report risk scovel shawe smale sparseness springer statist statistical steinwart submitted support taylor tech theory trans tsybakov universally university vector yang york zhang zhou
http://books.nips.cc/papers/files/nips17/NIPS2004_0536.pdf	110	Pictorial Structures for Molecular Modeling: Interpreting Density Maps	acta algorithm angelov application approximate automates bayes belief biol christopher cowtan cryst crystallographic cvpr density dimensional distributed distributions document efficient electron extension fast feature felzenszwalb fitting fourier freeman general greer holton huttenlocher hybrid improvement inference interpreting ioerger ismb koller lamzin lerner levitt mandel maps matching mitchell nets nips nonparametric occlusion pattern perrakis phases pictorial proc propagation protein reasoning recognition references rotations routine sacchettini sixma software structures sudderth system textal that three tracking uniform unpublished warp willsky wilson with
http://books.nips.cc/papers/files/nips17/NIPS2004_0601.pdf	127	A Method for Inferring Label Sampling Mechanisms in Semi-Supervised Learning	acton america analysis annals assoc automatic autoregressions barry bayes bias building carpentary classification classifiers common data dennis dependent distributions documents economic empirical equations estimator examples from hall hastie heckman icdm icml jersey labeled learning limited little logistic machine machines math mccallum measurement methods missing mitchell models nigam nonlinear nonstandard numerical optimization pace positive prentice prob proceedings references regression rubin sample schnabel selection semi simple situations social sons sparse spatial stat statistical statistics structure such supervised support text that thrun truncation unconstrained unlabeled unpublished using vardi variables vector wahba washington weighted wiley with work
http://books.nips.cc/papers/files/nips17/NIPS2004_0542.pdf	113	Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection	additive advances akad akaho algorithm algorithms annu appear application artificial asai auxiliary becker bioinformatics biological boosting bounds bregman cambridge chuang clustering common completion comput computation computer conf conference confidence convex data decision descent distance divergences dokl editors entropy exponentiated finding freund from function generalization generalized golden gradient helmholtz icann improved inference information international jordan journal kernel kernels kivinen kwok lafferty learning line linear loss lower machine matrix maximizing method metric models multidimensional nauk networks neural nielsen noble obermayer pages phys point predictions predictors press problems proc proceedings processing projection projections quantum rated references regression relative research russell schapire scholkopf sciences sets side singer smola sssr successive system systems theoretic theory thrun tsang tsuda university using versus warmuth with xing york
http://books.nips.cc/papers/files/nips17/NIPS2004_0801.pdf	181	Theory of Localized Synfire Chain: Characteristic Propagation Speed of Stable Spike Patterns	aaron abeles activity aertsen aihara amit approach architecture aronov arrows attractors before behaving bergman binocular both brunel cambridge cateau cerebral chain chains chang circuit circuits columnar comp computation connected connectivity constructed cooper correlated cortex cortical corticonics cossart dependent diagram diesmann difference doupe dynamics engel equation equations evolution exhibit fast ferster fields figure fire firing flow fokker following frontal fukai functional gerstner gewaltig global gray hakim hamaguchi high hubel ikegaya indicate indicates information integrate inter interaction iteratively kimpo kistler konig lampl layer layered layers learning local localized mainen margalit mexican modules monkeys multiple nature necessary nelson neocortical network networks neural neurocomputing neurons neurophysiol neurosci neuroscience noisy ones oscillations oscillatory packet packets parameter patterns phys physiol planck plot populations practical propagate propagation properties pulse pulses quantitative rate rates receptive recurrent references reflects region reliability responses results reyes risken rossum scheme science sejnowski sequence shown singer slower songs space spatiotemporal spike spiking springer stable stages stimulus synchronization synchronous synchrony synfire systems temporal than that these theunissen through time timing transfer turrigiano type uniform vaadia verlag visual vitro where which wiesel with yuste
http://books.nips.cc/papers/files/nips17/NIPS2004_0447.pdf	86	Kernel Methods for Implicit Surface Modeling	advances asymptotically available based basis beatson becker bounds cambridge carr cases chang chapelle cherrie cjlin computation computer conf csie cubes data description dietterich dimensional distribution duin dynamical editors efficient estimating evans extraction feature forum fright functions geometric ghahramani giesen graphics gross guarantee high http implementation incorporating information interactive invariances john journal keiser learning level lewiner library libsvm lopes machine machines marching mccallum methods mitchell multi nature neural nonlinear objects osher pages paragios pauly platt point press proc processing radial reconstruction references representation sampled saul scale scholkopf sharp shawe smola software some sparseness springer statistical steinwart support surface surfaces svms system systems tavares taylor techniques theory thrun tools topological vapnik vector verlag williamson wilson with york
http://books.nips.cc/papers/files/nips17/NIPS2004_0197.pdf	25	Confidence Intervals for the Area under the ROC Curve	aaai above academic addison advances akademie analysis annals application area aviv bamber based below birnbaum boosting bounds california canada carloz characteristic chauchat class classifier colagrosso comparison computational concrete conference consistency constrained corinna cortes cost curve customer dantzig data decision detection discovery distribution dodier dominance donald efficient egan eric error european evaluation fawcett ferri flach flexible francisco freund gain generalization graham graph groups guerra hanley hernandez holden imprecise induction information international journal kaufmann klose knowledge knuth koninklijke laboratory learning lehmann logistic lyon machine mann marketing massachusetts master math mathematical mathematics matrix mcneil meaning mehryar methods minimization mining models mohri morgan mozer nederlandse neural nips nonparametrics online operating optimization optimizing orallo ordinal oren patashnik pelletier performance perlich power press proceedings processing prodding provost psychology radiology rakotomalala ranking ranks rate reading receiver references regression report research robert ronald rosset saharon salcedo sample schapire second series signal simonoff statistic statistical statistics systems targeting technical test theoretical theory thesis third tree trees under university using vancouver variance visualization volume wesley weterschappen whitney wilcoxon wolniewicz yoav
http://books.nips.cc/papers/files/nips17/NIPS2004_0867.pdf	200	Semi-supervised Learning with Penalized Probabilistic Clustering	advances algorithm background bannerjee basu bayesian bouman cardie carlo chain clustering computer computing conference constrained constraints data dempster department eighteenth equivalence field from gaussian hertz hillel ieee image incomplete inference information instance international journal kamvar klein knowledge laird learning level likelihood machine making manning march markov maximum means methods mixture model models monte mooney most multiscale neal neural nineteenth pages prior probabilistic proceedings processing random references report rogers royal rubin schroedl science seeding segmentation semi series shapiro shental society space statistical supervised system technical toronto trans university using volume wagstaff weinshall with
http://books.nips.cc/papers/files/nips17/NIPS2004_0620.pdf	134	Inference, Attention, and Decision in a Bayesian Neural Architecture	abst acetylcholine acknowledgement activity addressed allocation also altered alternative analysis anderson annu area ascribing associated aston attention attentional banburismus barber bayesian behavioral between bifurcation biological bogacz bowman brain brown cambridge change changes chaos charitable chelazzi choice cholinergic circuits clark codes coeruleus cohen comput computation context control cortex cortical covert dayan decision decisions decoding depending detected differential discussions distinct distributional doubly effect effects elementary eric excitation expected fleet forced formal foundation from fukuada function functions funding gatsby gold grateful have helpful holmes human iain icann implement inference inferring influences info information input integration interpretation into issue john jonathan jones kastner kertzman kimura kubiak latham learning likelihoods locus luce macaque macaques machine making maunsell mcadams mechanisms mental models modulation moehlis monkey multiplicity murray neocortex networks neural neuron neurons neurophys neurophysiological neurosci neurotransmission noise norepinephrine novel optical optimal optimize organization orientation orienting overt oxford perc performance peter phasic phil phillips physics population posner possible pouget preparation press prob probabilistic process processing psychol psychopharm putting rajkowski ratcliff recording recurrent references related relationship representation response revealed reward reynolds robinson role sahani schwarz sensory sequential shadlen signaling simple simultaneous single sons source spread state statistical stimuli stimulus strategy suppresses synapse systems task tasks that their this times tonic tuning tusomoto uncertainties uncertainty unexpected ungerleider univ velocity vigilance vision visual visuospatial wald weiss when wiley with york zemel
http://books.nips.cc/papers/files/nips17/NIPS2004_0392.pdf	73	Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices	advances algebra algebraic alon american amos analysis anna anthony approximation azar bartlett boolean bounded bounding bounds cambridge chapter chernovenkis chervonenkis classes collaborative comb combinatorics communication competitive complexity computational computer computing concentration concept conference configurations crammer cristianini cube dasgupta data david dimension discrete drineas editors factorization fiat filtering focs foundations frank frankl from geometrical geometry goldberg goodman graham grotschel handbook haussler higher hofmann holland identification information institute international iordanis jaakkola jacob jared jason jerrum john kandola karlin kerenidis latent learning lindenbaum localization long lovasz lower machine manifolds margin mark martin massachusetts mathematical mathematika matrix matroids maximum mcsherry michael models nathan nello networks neural noga nonlinear north number numbers packing pages parameterized paul peter petros philip pollack polytopes prabhakar pranking press probabilistic processing properties query raghavan rank ranking real realization recommendation references rennie richard rodel saia sanjoy science selection semantic semi sets shai shawe singer society spectral sphere srebro subsets symposium syst systems taylor technology theoretical theory thesis thoery tommi tools trans transactions university upper vapnick vapnik volume warren weighted with yossi
http://books.nips.cc/papers/files/nips17/NIPS2004_0347.pdf	63	Sampling Methods for Unsupervised Learning	algorithm american analysis annealing application applications automated bayesian bolles carlo cartography chum comm components computation consensus cviu dagm data dempster deterministic eccv estimating estimation estimator fischler fitting from geometry ghahramani green guided hinton image implementation incomplete josef journal kittler laird likelihood locally matas maximum mixture mixtures mlesac model models monte motion murray nakano networks neural number ondej optimized pages paradigm parameter proc proceedings random ransac references review richardson robust royal rubin sample sampling sept siam smem society statistical stewart symposium tanner tordoff torr ueda unknown with zisserman
http://books.nips.cc/papers/files/nips17/NIPS2004_0225.pdf	29	Dependent Gaussian Processes	abstracts advances algorithms analysis anderson barnett bayesian becker blindern cambridge carlo carnegie center chain chatwin classification classifiers computer computing convolutions correlation covariance current data department dept efficient environmental evaluation fields functions gaussian gpros graduate hasselmo html ieee image implementation inference information intelligence issues learning linear machine mackay markov mellon methods modelling models monte mozer multiple networks neural nips nonstationary norway norwegian obermayer oslo other output pattern pennsylvania pittsburgh press probabilistic process processes processing quantitative random references regression reinforcement replacement report resolution review science shaarawi space spatial springer statistics submitted super supervised systems tech theory thesis thrun time toronto touretzsky trans tutorial univ university using variational verlag victoria wellington wiley with
http://books.nips.cc/papers/files/nips17/NIPS2004_0380.pdf	71	At the Edge of Chaos: Real-time Computations and Self-Organized Criticality in Recurrent Neural Networks	annealed approximation automata based bertschinger bornholdt chaos chaotic communication computation computing connected critical derrida dynamical edge energy europhys field framework gates glasses haas harnessing http information jaeger langton lett maass markram math mean meanfield natschlager networks neural nonlinearity organized perturbations phase phys physica physical pomeau predicting random randomly real recurrent references review rohl saving science self simple spin stable states supplement supplementary symmetric systems theory threshold time tnatschl transition tugraz wireless without
http://books.nips.cc/papers/files/nips17/NIPS2004_0738.pdf	167	Exponential Family Harmoniums with an Application to Information Retrieval	advances agakov algorithm allocation american analysis artificial author authors binary blei boltzmann california canada cognition collaborative components computation conference continuous contrastive deerwester diego diffusion direction dirichlet distributed distributions divergence documents dumais dynamical editors experts explorations extreme factor field filtering foundations freund furnas griffiths harmony harshman haussler hill hinton hofmann indexing information intelligence international jordan journal landauer latent layer learning lending machine machines madrid marks marlin mcclelland mcgraw mean microstructure minimizing model movellan mozer mplab multiple multiplicative networks neural osindero pages parallel probabilistic proc proceedings processing products references report representations research rosen rumehart science semantic smolensky smyth society spain sparse steyvers stockholm student systems technical theory thomas topic topographic training ucsd uncertainty university unsupervised using valued vancouver vectors volume welling williams with york zemel
http://books.nips.cc/papers/files/nips17/NIPS2004_0745.pdf	168	Markov Networks for Detecting Overlapping Elements in Sequence Data	aaai abbeel accuracy alberta algorithms artificial bacterial baldi bioinformatics biology blattner bockhorst brunak characterization chauvin codons comparison computational computer conditional conf conll craven data discriminative edmonton efficient entropy ermolaeva estimation eukaryotic evaluation expression factorial felzenszwalb fields finding gene genomes ghahramani glasner hidden http huttenlocher ieee improved inference institute intel internat international jects jordan kaufmann khalak koller labeling lafferty language learning ligence ligent locating louis machine malouf markov matching mateo maximum mccallum models molecular morgan nakai national networks nist nlpir novel pages parameter pattern pearl pedersen pereira pictorial plausible predicting prediction press probabalistic probabilistic proc prokaryotic promoters random reasoning recognition references relational research retrieval salzberg segmenting sequence sixth smith standards start structures suppl system systems takagi taskar technology terminators totoki transcription trec trecvid uncertainty units using video vision white williamstown with workshop yada
http://books.nips.cc/papers/files/nips17/NIPS2004_0346.pdf	62	Following Curved Regularized Optimization Solution Paths	acta allgower analysis angle annals appear asymptopia biostatistics boosting chappell classification classifier continuation dept donoho editor efron elements entire estimation feature following friedman gene generalization georg gradient hastie http icml information johnstone journal jrssb kerkyachairan lasso learning least likelihood linear logistic machine machines margin mathematics maximum microarrays neural norm numer papers path paths penalized phdthesis picard piecewise processing references regression regularization regularized research risk rosset saharon selection shrinkage smoothing soft solution spline springer stanford stat statistics submitted support systems thesis tibshirani topics university variance vector verlag wahba wang wavelet wolpert
http://books.nips.cc/papers/files/nips17/NIPS2004_0371.pdf	69	Efficient Out-of-Sample Extension of Dominant-Set Clusters	addison advances algorithm anal analysis annealing approach based becker belongie bengio berlin boyer buhmann burkhardt cambridge canad change chun cluster clustering computer conf cuts data delalleau deterministic dietterich dominant dynamics eccv eigenmaps eigenvalues eigenvectors embedding evolutionary extensions factorization feature fowlkes freeman game ghahramani graph graphs grouping hierarchical hofmann ieee image information intell isomap jordan kawanabe laub linear luenberger machine malik math maxima measures method motzkin neumann neural nonlinear nonmetric normalized nystrom optimal organization ouimet paiement pairwise pattern pavan pelillo perona preserving press proc processing programming proof proximity quantitative reading recognition references roth roux sample sarkar saul scholkopf segmentation sets spectral springer straus systems texture theorem theoretic theory thrun trans turan understanding unifying unsupervised using view vincent vision weibull weiss wesley
http://books.nips.cc/papers/files/nips17/NIPS2004_0835.pdf	191	Multiple Relational Embedding	advances algorithmic alignment allinson analysis andrew application bilinear cambridge carroll chang characterizing clustering cohn coil columbia computation conference content continuum correspondences cristianini daniel data david decomposition differences dimensional dimensionality distance douglas eckart efficiently eigensignatures embedding eric face framework freeman from general generalization geoffrey geometric global graham hierarchical high hinton icml image individual information informed international jakob john jordan joshua labeled langford learning library linear local locally machine manifolds metric michael michinari mining models momma multidimensional murase nayar neighbor nello nene neural nigel nikos nonlinear object paccanaro pages press proc proceedings processing projections psychometrika purpose recognition reduction references relational report roweis russell saul scaling science separating side sideinformation silva stochastic structures stuart style systems technical tenenbaum theory tijl unlabeled using verbeek virtual vlassis washington william with workshop xing young
http://books.nips.cc/papers/files/nips17/NIPS2004_0661.pdf	145	Modeling Nonlinear Dependencies in Natural Images using Mixture of Laplacian Distribution	about across additional also analysis analytic application applications assessment assume august automatic been bell between blind boundaries bovik building captured classes classification code coding compare compneuro component components comput computation concepts considered context contexts conventional correlated correlation correspond current data decomposition denoising dependency discover distributions domain edge emergence estimation experiments exploit extensions fast feature features fields filter filters finally frequency furthermore future gaussian gaussians generated given groups hidden hierarchies high higher highly hinton hoyer html http hyvarinen ieee image images improved independent index information into invariant june karklin labeling lean learned learning level lewicki likelihood localization location matlab maximum methods mixture mixtures model models more natural nearly network neural neurocomputing nips nongaussian object october order osindero other outperforms pami patches performance phase plan portilla previous prior processing products projects promising proposed provides quality receptive references regularities regularity representations research restoration result results reveals scale scenes seems segmentation sejnowski separation sheikh shift show showed shown shrinkage signal signals similar simoncelli since source space sparse spatial specific ssim strela strong structure structured structures student subspaces such suggest surface surfaces switching syst textures that topographic traditional trans transactions types unsupervised used using variance variances viable vision wainwright wang wavelet welling which wiener with work
http://books.nips.cc/papers/files/nips17/NIPS2004_0595.pdf	125	Responding to modalities with different latencies	acquisition alexander approach architecture basal behavioral carnegie cerebellum cerebral circuits cogn comput computational computations continuous control cortex cortico crutcher dopamine doya execution functional ganglia haruno hikosaka implications kawato learning mechanisms mellon miyachi model models mosaic nakahara nakamura netw networks neural neurosci parallel procedures processing rand references reinforcement sakai sensorimotor sequences sequential space substrates system their thesis time trends university visuomotor what wolpert
http://books.nips.cc/papers/files/nips17/NIPS2004_0585.pdf	122	Semigroup Kernels on Finite Sets	aaai advances akutsu alignment amari american analysis angles aronszajn bach basic bayesian berg between beyond biology cambridge christensen component computational conference context covariance cover cuturi diffusion editors elements from generative geometry harmonic icml ieee independent information international jebara joint jordan journal kernel kernels kondor lafferty learning lebanon local machine machines mathematical method methods models mutual nagaoka networks neural optimization over pages press principal proceedings processing properties protein references regularization reproducing research ressel saigo schoelkopf scholkopf seeger semigroups sequences sets shashua shtarkov smola society sons springer support systems theory thomas tjalkens transactions transancations tree tsuda twentieth using vector vectors vert weighting wiley willems with wolf york
http://books.nips.cc/papers/files/nips17/NIPS2004_0360.pdf	65	The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space	advances algorithm algorithms analysis artificial based brand canada chapman clustering computer conference connection data density eigenvectors embedding equations estimation florida function functions hall huang ieee information integral intel international introduction jordan kernel learning ligence london machines math mercer method mika mode muller negative networks neural ninth nystrom parzen philos positive probability processing ratsch references scholkopf seeger segmentation silverman spectral speed stat statistics systems their theorem theory trans transactions tsuda type unifying using vancouver view vision weiss west williams with workshop
http://books.nips.cc/papers/files/nips17/NIPS2004_0369.pdf	68	An Application of Boosting to Graph Classification	adaboost akihiro algoritms application arching bartlett based between boostexter boosting breiman categorization chris classification collins computation computer convolution craig cristianini cruz data david decision discrete dual duffy effectiveness explanation freund games generalization graph graphs gspan gunnar haussler hisashi huma icdm icml inokuchi interscience jiawei john journal kashima kernels klaus koji koyanagi labeled language learning line linux lodhi machine margin marginalized margins methods michael mining muller natural nello neural nigel nips onoda pages pattern performances peter prediction proc processors ratsch references report research robert santa saunders schapire semi shawe sicences singer soft statistical string structured structures substructure system takashi taylor technical teruo tested text theoretic theory tsuda using vapnik vladimir voting watkins wiley with xeon xifeng yoav yoram