Sciweavers

64 search results - page 7 / 13
» Reasoning with Cardinal Directions: An Efficient Algorithm
Sort
View
CCS
2007
ACM
13 years 11 months ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
BMCBI
2007
161views more  BMCBI 2007»
13 years 7 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
SDM
2010
SIAM
283views Data Mining» more  SDM 2010»
13 years 9 months ago
Cascading Spatio-temporal Pattern Discovery: A Summary of Results
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...
Pradeep Mohan, Shashi Shekhar, James A. Shine, Jam...
PCM
2005
Springer
288views Multimedia» more  PCM 2005»
14 years 28 days ago
Adaptive Deinterlacing for Real-Time Applications
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
Qian Huang, Wen Gao, Debin Zhao, Huifang Sun
AIPS
2010
13 years 9 months ago
Computing Applicability Conditions for Plans with Loops
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...