Sciweavers

1191 search results - page 35 / 239
» Compute the Term Contributed Frequency
Sort
View
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 7 days ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
AC
1998
Springer
14 years 11 months ago
Natural Language Processing: A Human-Computer Interaction Perspective
Natural language processing has been in existence for more than fifty years. During this time, it has significantly contributed to the field of human-computer interaction in terms...
Bill Z. Manaris
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 18 hour ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
ATAL
2008
Springer
15 years 1 months ago
A best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
Chattrakul Sombattheera, Aditya Ghose
AIPS
2009
15 years 1 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith