806 search results - page 144 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Web-database systems are nowadays an integral part of everybody's life, with applications ranging from monitoring/trading stock portfolios, to personalized blog aggregation a...
BIOCOMP
2007
13 years 9 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
AH
2008
Springer
14 years 2 months ago
2008
Springer
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...