Sciweavers

9209 search results - page 1413 / 1842
» Data Space Randomization
Sort
View
LICS
2007
IEEE
16 years 1 months ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat
INFOCOM
2006
IEEE
16 years 26 days ago
Scalable Clustering of Internet Paths by Shared Congestion
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
Min Sik Kim, Taekhyun Kim, YongJune Shin, Simon S....
IPPS
2005
IEEE
16 years 12 days ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
16 years 3 days ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
16 years 1 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
« Prev « First page 1413 / 1842 Last » Next »