Sciweavers

777 search results - page 122 / 156
» Declarative Data Cleaning: Language, Model, and Algorithms
Sort
View
SMA
2009
ACM
208views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Accelerating geometric queries using the GPU
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
Adarsh Krishnamurthy, Sara McMains, Kirk Haller
JMLR
2012
11 years 10 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
ICALP
2009
Springer
14 years 8 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
FDL
2005
IEEE
14 years 1 months ago
SystemC-Based Communication and Performance Analysis
In today’s electronic system-level (ESL) design processes, an early analysis of a system’s communication and nce characteristics is becoming a key challenge. The availability ...
Axel G. Braun, Joachim Gerlach, Wolfgang Rosenstie...
POPL
2007
ACM
14 years 8 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...