Sciweavers

425 search results - page 50 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
IPPS
2009
IEEE
15 years 6 months ago
Resource allocation strategies for constructive in-network stream processing
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo,...
WABI
2005
Springer
108views Bioinformatics» more  WABI 2005»
15 years 4 months ago
On the Complexity of Several Haplotyping Problems
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
IJCAI
2007
15 years 22 days ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 11 months ago
Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
Brieuc Conan-Guez, Fabrice Rossi, Aïcha El Go...
NAACL
2007
15 years 22 days ago
Incremental Non-Projective Dependency Parsing
An open issue in data-driven dependency parsing is how to handle non-projective dependencies, which seem to be required by linguistically adequate representations, but which pose ...
Joakim Nivre