Sciweavers

1933 search results - page 299 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
JAIR
2000
105views more  JAIR 2000»
13 years 8 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
13 years 20 days ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
FOCS
1995
IEEE
14 years 15 days ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
IDA
2009
Springer
14 years 3 months ago
How to Control Clustering Results? Flexible Clustering Aggregation
One of the most important and challenging questions in the area of clustering is how to choose the best-fitting algorithm and parameterization to obtain an optiml clustering for t...
Martin Hahmann, Peter Benjamin Volk, Frank Rosenth...
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 3 months ago
Managing Network Congestion with a Kohonen-Based RED Queue
— The behaviour of the TCP AIMD algorithm is known to cause queue length oscillations when congestion occurs at a router output link. Indeed, due to these queueing variations, en...
Emmanuel Lochin, Bruno Talavera