Sciweavers

8294 search results - page 1138 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
NIPS
2007
15 years 8 months ago
Multiple-Instance Active Learning
We present a framework for active learning in the multiple-instance (MI) setting. In an MI learning problem, instances are naturally organized into bags and it is the bags, instea...
Burr Settles, Mark Craven, Soumya Ray
AROBOTS
2005
88views more  AROBOTS 2005»
15 years 6 months ago
Head Movements for Depth Perception: Praying Mantis versus Pigeon
Abstract. Inspired by the abilities of both the praying mantis and the pigeon to judge distance by use of motionbased visually mediated odometry, we create miniature models for dep...
Alfred M. Bruckstein, Robert J. Holt, Igor Katsman...
194
Voted
DASFAA
2004
IEEE
125views Database» more  DASFAA 2004»
15 years 10 months ago
Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining
Data mining is a process that analyzes voluminous digital data in order to discover hidden but useful patterns from digital data. However, discovery of such hidden patterns has sta...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
212
Voted
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 8 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 6 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
« Prev « First page 1138 / 1659 Last » Next »