Sciweavers

4903 search results - page 966 / 981
» The Set Covering Machine
Sort
View
EJC
2007
15 years 12 days ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
PR
2008
228views more  PR 2008»
15 years 11 days ago
Accurate integration of multi-view range images using k-means clustering
3D modelling finds a wide range of applications in industry. However, due to the presence of surface scanning noise, accumulative registration errors, and improper data fusion, re...
Hong Zhou, Yonghuai Liu
SIGARCH
2008
73views more  SIGARCH 2008»
15 years 11 days ago
Servo: a programming model for many-core computing
Conventional programming models were designed to be used by expert programmers for programming for largescale multiprocessors, distributed computational clusters, or specialized p...
Nicolas Zea, John Sartori, Rakesh Kumar
102
Voted
SIGIR
2008
ACM
15 years 11 days ago
Crosslingual location search
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
Tanuja Joshi, Joseph Joy, Tobias Kellner, Udayan K...
108
Voted
SIGIR
2008
ACM
15 years 11 days ago
Learning from labeled features using generalized expectation criteria
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
Gregory Druck, Gideon S. Mann, Andrew McCallum