Sciweavers

3824 search results - page 538 / 765
» Geometry Constructions Language
Sort
View
PLDI
2012
ACM
13 years 6 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
150
Voted
PLDI
2012
ACM
13 years 6 months ago
Effective parallelization of loops in the presence of I/O operations
Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...
Min Feng, Rajiv Gupta, Iulian Neamtiu
157
Voted
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
15 years 2 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
152
Voted
ER
2009
Springer
152views Database» more  ER 2009»
15 years 1 months ago
Towards a Theory of Conceptual Modelling
: Conceptual modelling is a widely applied practice and has led to a large body of knowledge on constructs that might be used for modelling and on methods that might be useful for ...
Bernhard Thalheim
136
Voted
COORDINATION
2009
Springer
16 years 4 months ago
Exceptionally Safe Futures
A future is a well-known programming construct used to introduce concurrency to sequential programs. Computations annotated as futures are executed asynchronously and run concurren...
Armand Navabi, Suresh Jagannathan