Sciweavers

1403 search results - page 180 / 281
» Set cover algorithms for very large datasets
Sort
View
193
Voted
VLDB
2002
ACM
161views Database» more  VLDB 2002»
15 years 5 months ago
XMark: A Benchmark for XML Data Management
While standardization efforts for XML query languages have been progressing, researchers and users increasingly focus on the database technology that has to deliver on the new cha...
Albrecht Schmidt 0002, Florian Waas, Martin L. Ker...
PAMI
2010
273views more  PAMI 2010»
15 years 26 days ago
Correspondence-Free Activity Analysis and Scene Modeling in Multiple Camera Views
We propose a novel approach for activity analysis in multiple synchronized but uncalibrated static camera views. In this paper, we refer to activities as motion patterns of objects...
Xiaogang Wang, Kinh Tieu, W. Eric L. Grimson
ISBRA
2010
Springer
16 years 18 days ago
Uncovering Hidden Phylogenetic Consensus
Abstract. Many of the steps in phylogenetic reconstruction can be confounded by “rogue” taxa, taxa that cannot be placed with assurance anywhere within the tree—whose locatio...
Nicholas D. Pattengale, Krister M. Swenson, Bernar...
164
Voted
BMCBI
2005
73views more  BMCBI 2005»
15 years 6 months ago
Evaluation of Glycine max mRNA clusters
Background: Clustering the ESTs from a large dataset representing a single species is a convenient starting point for a number of investigations into gene discovery, genome evolut...
Ronald L. Frank, Fikret Erçal
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 6 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin