1967 search results - page 267 / 394 » The Case for Determinism in Database Systems |
197
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
170
click to vote
SIGCOMM
1998
ACM
15 years 11 months ago
1998
ACM
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
221
click to vote
ICAIL
2005
ACM
16 years 7 days ago
2005
ACM
Computational resources for research in legal environments have historically implied remote access to large databases of legal documents such as case law, statutes, law reviews an...
287
click to vote
GIS
2005
ACM
16 years 7 months ago
2005
ACM
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
297
Voted
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...