Sciweavers

835 search results - page 107 / 167
» An algorithmic approach to event summarization
Sort
View
SIGMOD
2002
ACM
135views Database» more  SIGMOD 2002»
15 years 10 months ago
StatiX: making XML count
The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query opti...
Juliana Freire, Jayant R. Haritsa, Maya Ramanath, ...
PLDI
2010
ACM
15 years 7 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
ICDAR
2005
IEEE
15 years 3 months ago
Tracking, Analysis, and Recognition of Human Gestures in Video
An overview of research in automated gesture spotting, tracking and recognition by the Image and Video Computing Group at Boston University is given. Approaches for localization a...
Stan Sclaroff, Margrit Betke, George Kollios, Jona...
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 9 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
TKDE
2008
191views more  TKDE 2008»
14 years 9 months ago
Beyond Single-Page Web Search Results
Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their "goodness" with respect to the query. Thus, the basic unit fo...
Ramakrishna Varadarajan, Vagelis Hristidis, Tao Li