8695 search results - page 427 / 1739 » Making the Complex Simple |
244
click to vote
HEURISTICS
2010
15 years 5 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
195
click to vote
DAM
2011
15 years 2 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
935
click to vote
Book
"Bison is a general-purpose parser generator that converts an annotated context-free grammar
into an LALR(1) or GLR parser for that grammar. Once you are proficient with Biso...
185
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
We present an extremely simple yet robust multi-view stereo algorithm and analyze its properties. The algorithm first computes individual depth maps using a window-based voting ap...
319
click to vote
ICDE
2007
IEEE
16 years 9 months ago
2007
IEEE
As relational databases proliferate and become increasingly complex, both in their internal structure and in their interactions with other databases and applications, there is a g...