Sciweavers

706 search results - page 105 / 142
» Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Sort
View
ICDE
2008
IEEE
219views Database» more  ICDE 2008»
14 years 10 months ago
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...
Osman Abul, Francesco Bonchi, Mirco Nanni
ICML
2007
IEEE
14 years 9 months ago
Focused crawling with scalable ordinal regression solvers
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
Rashmin Babaria, J. Saketha Nath, S. Krishnan, K. ...
ICPR
2006
IEEE
14 years 10 months ago
Adaptive Step Size Window Matching for Detection
An often overlooked problem in matching lies in selecting an appropriate step size. The selection of the step size for real-time applications is critical both from the point of vi...
Nathan Mekuz, Konstantinos G. Derpanis, John K. Ts...
ICML
2003
IEEE
14 years 9 months ago
Transductive Learning via Spectral Graph Partitioning
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Thorsten Joachims
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 2 months ago
Pattern Identification in Biogeography
—Identifying common patterns among area cladograms that arise in historical biogeography is an important tool for biogeographical inference. We develop the first rigorous formali...
Ganeshkumar Ganapathy, Barbara Goodson, Robert K. ...