2735 search results - page 200 / 547 » Generalized Displacement Maps |
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
PE
2010
Springer
13 years 7 months ago
2010
Springer
We propose a trace fitting algorithm for Markovian Arrival Processes (MAPs) that can capture statistics of any order of interarrival times between measured events. By studying re...
TIP
2010
13 years 7 months ago
2010
—Salient areas in natural scenes are generally regarded as areas which the human eye will typically focus on, and finding these areas is the key step in object detection. In com...
WWW
2011
ACM
13 years 4 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
While current search engines serve known-item search such as homepage finding very well, they generally cannot support exploratory search effectively. In exploratory search, user...