Sciweavers

4908 search results - page 29 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
15 years 8 months ago
Systematic Approach for Optimizing Complex Mining Tasks on Multiple Databases
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
Ruoming Jin, Gagan Agrawal
INFOCOM
2007
IEEE
15 years 8 months ago
Optimal-Complexity Optical Router
—In the past years, electronic routers have had trouble keeping up with the increase in optical fiber capacity. As their power consumption has grown exponentially and already ex...
Hadas Kogan, Isaac Keslassy
EOR
2008
103views more  EOR 2008»
15 years 2 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
ICRA
2003
IEEE
111views Robotics» more  ICRA 2003»
15 years 7 months ago
Multi-robot task allocation: analyzing the complexity and optimality of key architectures
— Important theoretical aspects of multi-robot coordination mechanisms have, to date, been largely ignored. To address part of this negligence, we focus on the problem of multi-r...
Brian P. Gerkey, Maja J. Mataric
FOSSACS
2008
Springer
15 years 3 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen