Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
10 years 9 months ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
10 years 9 months ago
Energy Efficient Deadline Scheduling in Two Processor Systems
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
ISAAC
2007
Springer
131views Algorithms» more  ISAAC 2007»
10 years 9 months ago
On the Fault Testing for Reversible Circuits
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...
Satoshi Tayu, Shigeru Ito, Shuichi Ueno
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
10 years 9 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
10 years 9 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
ISAAC
2007
Springer
111views Algorithms» more  ISAAC 2007»
10 years 9 months ago
Capacitated Domination Problem
Mong-Jen Kao, Chung-Shou Liao
ISAAC
2007
Springer
105views Algorithms» more  ISAAC 2007»
10 years 9 months ago
Unbounded-Error Classical and Quantum Communication Complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
ISAAC
2007
Springer
92views Algorithms» more  ISAAC 2007»
10 years 9 months ago
Using Nash Implementation to Achieve Better Frugality Ratios
Most of the recent works on algorithmic mechanism design exploit the solution concept of dominant strategy equilibria. Such work designs a proper payment scheme so that selfish ag...
Chien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, W...
ISAAC
2007
Springer
108views Algorithms» more  ISAAC 2007»
10 years 9 months ago
Checking Value-Sensitive Data Structures in Sublinear Space
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
Michael T. Goodrich, Jonathan Z. Sun
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
10 years 9 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
books