Sciweavers

1972 search results - page 170 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
15 years 6 months ago
Dynamic symbolic database application testing
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
Chengkai Li, Christoph Csallner
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 2 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
110
Voted
IJCV
2002
156views more  IJCV 2002»
15 years 2 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal
IPPS
2007
IEEE
15 years 8 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
ICDCS
2003
IEEE
15 years 7 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande