Sciweavers

2266 search results - page 225 / 454
» Generalizing parametric timing analysis
Sort
View
101
Voted
WWW
2009
ACM
16 years 1 months ago
Searching for events in the blogosphere
Over the last few years, blogs (web logs) have gained massive popularity and have become one of the most influential web social media in our times. Every blog post in the Blogosph...
Manolis Platakis, Dimitrios Kotsakos, Dimitrios Gu...
96
Voted
WWW
2006
ACM
16 years 1 months ago
A probabilistic approach to spatiotemporal theme pattern mining on weblogs
Mining subtopics from weblogs and analyzing their spatiotemporal patterns have applications in multiple domains. In this paper, we define the novel problem of mining spatiotempora...
Qiaozhu Mei, Chao Liu 0001, Hang Su, ChengXiang Zh...
COMPGEOM
2009
ACM
15 years 7 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
15 years 2 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
82
Voted
COR
2010
164views more  COR 2010»
15 years 29 days ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz