Sciweavers

4110 search results - page 363 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ECCV
2006
Springer
16 years 8 months ago
Learning to Combine Bottom-Up and Top-Down Segmentation
Bottom-up segmentation based only on low-level cues is a notoriously difficult problem. This difficulty has lead to recent top-down segmentation algorithms that are based on class-...
Anat Levin, Yair Weiss
SIGMOD
1996
ACM
84views Database» more  SIGMOD 1996»
15 years 11 months ago
Change Detection in Hierarchically Structured Information
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
Sudarshan S. Chawathe, Anand Rajaraman, Hector Gar...
GECCO
2006
Springer
190views Optimization» more  GECCO 2006»
15 years 10 months ago
Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system
In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The obje...
Haipeng Zhang, Mitsuo Gen
NETWORKING
2010
15 years 8 months ago
Bidirectional Range Extension for TCAM-Based Packet Classification
Abstract. Packet classification is a fundamental task for network devices such as edge routers, firewalls, and intrusion detection systems. Currently, most vendors use Ternary Cont...
Yan Sun, Min Sik Kim
AAAI
2006
15 years 8 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche