Sciweavers

583 search results - page 81 / 117
» Finding Answers to Complex Questions
Sort
View
PODS
2003
ACM
118views Database» more  PODS 2003»
14 years 10 months ago
Numerical document queries
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl
ALT
2009
Springer
14 years 7 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
RTCSA
2009
IEEE
14 years 4 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
TPCTC
2009
Springer
190views Hardware» more  TPCTC 2009»
14 years 4 months ago
A Performance Study of Event Processing Systems
Abstract. Event processing engines are used in diverse mission-critical scenarios such as fraud detection, traffic monitoring, or intensive care units. However, these scenarios hav...
Marcelo R. N. Mendes, Pedro Bizarro, Paulo Marques
TOOLS
2008
IEEE
14 years 4 months ago
Modeling of Component Environment in Presence of Callbacks and Autonomous Activities
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
Pavel Parizek, Frantisek Plasil