Sciweavers

9405 search results - page 394 / 1881
» Computing a Model of Set Theory
Sort
View
AAAI
2008
15 years 9 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
INFOCOM
2010
IEEE
15 years 4 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
COLING
2010
15 years 1 months ago
A Linguistically Grounded Graph Model for Bilingual Lexicon Extraction
We present a new method, based on graph theory, for bilingual lexicon extraction without relying on resources with limited availability like parallel corpora. The graphs we use re...
Florian Laws, Lukas Michelbacher, Beate Dorow, Chr...
CACM
1998
103views more  CACM 1998»
15 years 6 months ago
The Virtual Design Team
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
John C. Kunz, Tore R. Christiansen, Geoff P. Cohen...
CIKM
2011
Springer
14 years 6 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai