43264 search results - page 8355 / 8653 » Comparing models of computation |
100
click to vote
STOC
2006
ACM
15 years 11 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
149
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
150
click to vote
SIGMOD
2006
ACM
15 years 11 months ago
2006
ACM
Current application development tools provide completely different programming models for the application server (e.g., Java and J2EE) and the client web browser (e.g., JavaScript...
99
Voted
SIGMOD
2005
ACM
15 years 11 months ago
2005
ACM
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
88
Voted
PERCOM
2007
ACM
15 years 10 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...