Sciweavers

1027 search results - page 157 / 206
» Ordered Vertex Partitioning
Sort
View
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 8 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
DCC
2005
IEEE
14 years 8 months ago
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
Harri Haanpää, Petteri Kaski
ICCD
2008
IEEE
136views Hardware» more  ICCD 2008»
14 years 5 months ago
A resource efficient content inspection system for next generation Smart NICs
— The aggregate power consumption of the Internet is increasing at an alarming rate, due in part to the rapid increase in the number of connected edge devices such as desktop PCs...
Karthik Sabhanatarajan, Ann Gordon-Ross
HYBRID
2010
Springer
14 years 3 months ago
Accurate hybridization of nonlinear systems
This paper is concerned with reachable set computation for non-linear systems using hybridization. The essence of hybridization is to approximate a non-linear vector field by a s...
Thao Dang, Oded Maler, Romain Testylier
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
14 years 3 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu