Sciweavers

240 search results - page 30 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
14 years 6 days ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
ICCV
2005
IEEE
14 years 10 months ago
Beyond Trees: Common-Factor Models for 2D Human Pose Recovery
Tree structured models have been widely used for determining the pose of a human body, from either 2D or 3D data. While such models can effectively represent the kinematic constra...
Xiangyang Lan, Daniel P. Huttenlocher
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
14 years 8 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
ICCS
2005
Springer
14 years 2 months ago
SWAT: A New Spliced Alignment Tool Tailored for Handling More Sequencing Errors
Abstract. There are several computer programs that align mRNA with its genomic counterpart to determine exon boundaries. Though most of these programs perform such alignment effici...
Yifeng Li, Hesham H. Ali
SASO
2010
IEEE
13 years 6 months ago
Optimal Decentralized Formation of k-Member Partnerships
To keep pace with constantly changing markets, many companies are seeking strategic partnerships. In this paper, we assume that a company can electronically provide a profile of th...
Anna Chmielowiec, Maarten van Steen