Sciweavers

8278 search results - page 1356 / 1656
» Context-Aware Process Networks
Sort
View
CASCON
1996
77views Education» more  CASCON 1996»
15 years 6 months ago
Harvesting design for an application framework
Framework design begins with domain analysis. Either the problem domain is analyzed to create a new design, or the solution domain is analyzed to understand how the problem has al...
Joan Boone
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 4 months ago
On entropy for mixtures of discrete and continuous variables
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
Chandra Nair, Balaji Prabhakar, Devavrat Shah
EJC
2007
15 years 4 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
PVLDB
2008
108views more  PVLDB 2008»
15 years 4 months ago
Sliding-window top-k queries on uncertain streams
Query processing on uncertain data streams has attracted a lot of attentions lately, due to the imprecise nature in the data generated from a variety of streaming applications, su...
Cheqing Jin, Ke Yi, Lei Chen 0002, Jeffrey Xu Yu, ...
PVLDB
2008
154views more  PVLDB 2008»
15 years 4 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
« Prev « First page 1356 / 1656 Last » Next »