Sciweavers

962 search results - page 122 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
PVLDB
2008
134views more  PVLDB 2008»
14 years 9 months ago
Reasoning and identifying relevant matches for XML keyword search
Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches t...
Ziyang Liu, Yi Chen
LPAR
2010
Springer
14 years 7 months ago
Verifying Pointer and String Analyses with Region Type Systems
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
CVPR
2010
IEEE
15 years 6 months ago
Beyond Trees: MRF Inference via Outer-Planar Decomposition
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...
JMLR
2010
161views more  JMLR 2010»
14 years 4 months ago
Empirical Bernstein Boosting
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
Pannagadatta K. Shivaswamy, Tony Jebara
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
15 years 10 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng