1431 search results - page 121 / 287 » The complexity of random ordered structures |
145
click to vote
MIS
2001
Springer
15 years 7 months ago
2001
Springer
Multimedia databases deal with storage and retrieval of complex descriptors of image contents, called features. Traditional techniques consider features as “black boxes,” ofte...
139
click to vote
CC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
110
click to vote
SEMWEB
2005
Springer
15 years 8 months ago
2005
Springer
Recommender algorithms have been quite successfully employed in a variety of scenarios from filtering applications to recommendations of movies and books at Amazon.com. However, a...
133
click to vote
IPPS
1996
IEEE
15 years 7 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
113
click to vote
TCAD
2008
15 years 3 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...