Sciweavers

1399 search results - page 132 / 280
» New Algorithms for k-Center and Extensions
Sort
View
PVLDB
2008
146views more  PVLDB 2008»
13 years 8 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
SPRINGSIM
2010
13 years 7 months ago
GTNA: a framework for the graph-theoretic network analysis
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
Benjamin Schiller, Dirk Bradler, Immanuel Schweize...
ISMB
1994
13 years 10 months ago
An Improved System for Exon Recognition and Gene Modeling in Human DNA Sequence
A new version of the GRAIL system (Uberbacher and Mural, 1991; Mural et al., 1992; Uberbacher et al., 1993), called GRAILII, has recently been developed (Xu et al., 1994). GRAILII...
Yin Xu, J. Ralph Einstein, Richard J. Mural, Manes...
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 10 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
ICML
2003
IEEE
14 years 9 months ago
Adaptive Overrelaxed Bound Optimization Methods
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
Ruslan Salakhutdinov, Sam T. Roweis