Sciweavers

2089 search results - page 184 / 418
» A New Problem in String Searching
Sort
View
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
14 years 5 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
15 years 10 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
97
Voted
CG
2004
Springer
15 years 1 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
82
Voted
ICMCS
2010
IEEE
215views Multimedia» more  ICMCS 2010»
14 years 10 months ago
Efficient search of Top-K video subvolumes for multi-instance action detection
Action detection was formulated as a subvolume mutual information maximization problem in [8], where each subvolume identifies where and when the action occurs in the video. Desp...
Norberto A. Goussies, Zicheng Liu, Junsong Yuan
76
Voted
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
14 years 11 months ago
Searching for liveness property violations in concurrent systems with ACO
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
Enrique Alba, J. Francisco Chicano