Sciweavers

5606 search results - page 551 / 1122
» Randomization Techniques for Graphs.
Sort
View
EMNLP
2007
15 years 8 months ago
Instance Based Lexical Entailment for Ontology Population
In this paper we propose an instance based method for lexical entailment and apply it to automatic ontology population from text. The approach is fully unsupervised and based on k...
Claudio Giuliano, Alfio Massimiliano Gliozzo
CAS
1999
60views more  CAS 1999»
15 years 6 months ago
Coincidences Are not Accidental: a Theorem
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
Vladik Kreinovich
JMLR
2010
115views more  JMLR 2010»
15 years 2 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
16 years 9 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias
DAC
2009
ACM
16 years 8 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...