Sciweavers

1185 search results - page 81 / 237
» The Equivalence of Sampling and Searching
Sort
View
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
14 years 1 months ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...
EMNLP
2008
13 years 9 months ago
Mining and Modeling Relations between Formal and Informal Chinese Phrases from Web Corpora
We present a novel method for discovering and modeling the relationship between informal Chinese expressions (including colloquialisms and instant-messaging slang) and their forma...
Zhifei Li, David Yarowsky
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 8 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
MM
2004
ACM
178views Multimedia» more  MM 2004»
14 years 1 months ago
A bootstrapping framework for annotating and retrieving WWW images
Most current image retrieval systems and commercial search engines use mainly text annotations to index and retrieve WWW images. This research explores the use of machine learning...
HuaMin Feng, Rui Shi, Tat-Seng Chua
TOG
2002
107views more  TOG 2002»
13 years 7 months ago
Synthesis of bidirectional texture functions on arbitrary surfaces
The bidirectional texture function (BTF) is a 6D function that can describe textures arising from both spatially-variant surface reflectance and surface mesostructures. In this pa...
Xin Tong, Jingdan Zhang, Ligang Liu, Xi Wang, Bain...