Sciweavers

328 search results - page 64 / 66
» A word at a time: computing word relatedness using temporal ...
Sort
View
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 8 days ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
JACM
2007
160views more  JACM 2007»
13 years 5 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
OOPSLA
2007
Springer
13 years 12 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 5 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
WIMOB
2008
IEEE
14 years 3 days ago
An Ad Hoc Network Infrastructure: Communication and Information Sharing for Emergency Response
— During an emergency response, access to a reliable communication infrastructure is required to exchange accurate information in a timely manner. Various communication technolog...
Raheleh B. Dilmaghani, Ramesh R. Rao