Sciweavers

267 search results - page 42 / 54
» Finding robust solutions in requirements models
Sort
View
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 7 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
CVPR
2008
IEEE
14 years 9 months ago
Learning Bayesian Networks with qualitative constraints
Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model param...
Yan Tong, Qiang Ji
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 7 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
PLDI
2010
ACM
14 years 5 months ago
Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...
HICSS
2008
IEEE
130views Biometrics» more  HICSS 2008»
14 years 2 months ago
An Interview Protocol for Discovering and Assessing Collaboration Engineering Opportunities
Collaboration Engineering (CE) projects can run for months and can require substantial expenditures of effort and resources. CE is an approach to designing collaborative work prac...
Robert O. Briggs, Alanah J. Davis, John D. Murphy