244 search results - page 34 / 49 » Intervalizing k-Colored Graphs |
111
click to vote
ERCIMDL
2007
Springer
15 years 9 months ago
2007
Springer
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
120
Voted
ALENEX
2010
15 years 4 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
142
click to vote
ENDM
2010
15 years 3 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
217
click to vote
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
We propose a framework, called MIC, which adopts an information-theoretic approach to address the problem of quantitative association rule mining. In our MIC framework, we first d...
112
click to vote
EACL
1993
ACL Anthology
15 years 4 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...