1525 search results - page 130 / 305 » Matching with Regular Constraints |
133
click to vote
DISOPT
2008
15 years 4 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
203
click to vote
VLDB
2003
ACM
16 years 4 months ago
2003
ACM
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
128
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...
135
Voted
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
The sound reaching the acoustic sensor in a realistic environment contains not only the part arriving directly from the sound source but also a number of environmental re ections....
226
click to vote
GIS
2009
ACM
16 years 5 months ago
2009
ACM
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...