Sciweavers

1816 search results - page 153 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
LSSC
2001
Springer
15 years 11 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 10 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
15 years 11 months ago
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
Hisashi Koga
ICCAD
2001
IEEE
201views Hardware» more  ICCAD 2001»
16 years 3 months ago
An Integrated Data Path Optimization for Low Power Based on Network Flow Method
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
Chun-Gi Lyuh, Taewhan Kim, Chien-Liang Liu
ICRA
2005
IEEE
134views Robotics» more  ICRA 2005»
16 years 2 days ago
Reachability Analysis of Sampling Based Planners
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
Roland Geraerts, Mark H. Overmars