Sciweavers

83 search results - page 7 / 17
» Efficient algorithms for finding interleaving relationship b...
Sort
View
107
Voted
EDBT
2008
ACM
169views Database» more  EDBT 2008»
16 years 14 days ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
104
Voted
CGF
2005
111views more  CGF 2005»
15 years 7 days ago
Hierarchyless Simplification, Stripification and Compression of Triangulated Two Manifolds
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...
Pablo Diaz-Gutierrez, Meenakshisundaram Gopi, Rena...
119
Voted
BMCBI
2002
133views more  BMCBI 2002»
15 years 6 days ago
Identification and characterization of subfamily-specific signatures in a large protein superfamily by a hidden Markov model app
Background: Most profile and motif databases strive to classify protein sequences into a broad spectrum of protein families. The next step of such database studies should include ...
Kevin Truong, Mitsuhiko Ikura
TKDE
2002
168views more  TKDE 2002»
15 years 28 min ago
CLARANS: A Method for Clustering Objects for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contrib...
Raymond T. Ng, Jiawei Han
ICTAI
2000
IEEE
15 years 4 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche