Sciweavers

4114 search results - page 73 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CEC
2007
IEEE
15 years 8 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
SDM
2008
SIAM
119views Data Mining» more  SDM 2008»
15 years 6 months ago
An Efficient Local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compact...
Kanishka Bhaduri, Hillol Kargupta
AAAI
2010
15 years 6 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
ICPR
2004
IEEE
16 years 5 months ago
Direct Condensing: An Efficient Voronoi Condensing Algorithm for Nearest Neighbor Classifiers
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
Takekazu Kato, Toshikazu Wada
CORR
2008
Springer
135views Education» more  CORR 2008»
15 years 4 months ago
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
Thomas Thierauf, Fabian Wagner