Sciweavers

63 search results - page 10 / 13
» 06111 Abstracts Collection -- Complexity of Boolean Function...
Sort
View
CP
2006
Springer
13 years 11 months ago
Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
Cédric Pralet, Thomas Schiex, Gérard...
ISPASS
2005
IEEE
14 years 1 months ago
Analysis of Network Processing Workloads
Abstract— Network processing is becoming an increasingly important paradigm as the Internet moves towards an architecture with more complex functionality inside the network. Mode...
Ramaswamy Ramaswamy, Ning Weng, Tilman Wolf
SSD
2005
Springer
116views Database» more  SSD 2005»
14 years 1 months ago
PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectories
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
Jinfeng Ni, Chinya V. Ravishankar
DCOSS
2010
Springer
14 years 11 days ago
Tables: A Spreadsheet-Inspired Programming Model for Sensor Networks
Abstract. Current programming interfaces for sensor networks often target experienced developers and lack important features. Tables is a spreadsheet inspired programming environme...
James Horey, Eric Nelson, Arthur B. Maccabe
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
14 years 2 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...