Sciweavers

678 search results - page 126 / 136
» Structural Properties of Sparse Graphs
Sort
View
AAAI
2007
13 years 9 months ago
Conservative Dual Consistency
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
Christophe Lecoutre, Stéphane Cardon, Julie...
IWCMC
2010
ACM
13 years 9 months ago
A flow trace generator using graph-based traffic classification techniques
We propose a novel methodology to generate realistic network flow traces to enable systematic evaluation of network monitoring systems in various traffic conditions. Our technique...
Peter Siska, Marc Ph. Stoecklin, Andreas Kind, Tor...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 8 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
AMW
2009
13 years 8 months ago
Consistent Query Answering in Data Warehouses
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
Leopoldo E. Bertossi, Loreto Bravo, Mónica ...
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 7 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...