Sciweavers

4114 search results - page 455 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
AAAI
2008
15 years 9 months ago
Resource Constrained Distributed Constraint Optimization with Virtual Variables
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, ...
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
15 years 8 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
KDD
2002
ACM
286views Data Mining» more  KDD 2002»
16 years 7 months ago
Object Boundary Detection For Ontology-Based Image Classification
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential f...
Lei Wang, Latifur Khan, Casey Breen
BMCBI
2005
122views more  BMCBI 2005»
15 years 6 months ago
Bayesian coestimation of phylogeny and sequence alignment
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
Gerton Lunter, István Miklós, Alexei...