Sciweavers

887 search results - page 132 / 178
» A Time for Choosing
Sort
View
ICPR
2000
IEEE
14 years 11 months ago
Snakes and Spiders
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
Brendan McCane
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
ICDE
2010
IEEE
217views Database» more  ICDE 2010»
14 years 5 months ago
Toward industrial-strength keyword search systems over relational data
– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions ...
Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Nau...
IPPS
2009
IEEE
14 years 4 months ago
A resource allocation approach for supporting time-critical applications in grid environments
— There are many grid-based applications where a timely response to an important event is needed. Often such response can require a significant computation and possibly communic...
Qian Zhu, Gagan Agrawal
ICRA
2002
IEEE
100views Robotics» more  ICRA 2002»
14 years 3 months ago
Achieving Sharp Deliveries in Supply Chains through Variance Pool Allocation
Variability reduction and business process synchronization are acknowledged as key to achieving sharp and timely deliveries in supply chain networks. In this paper, we develop an ...
Dinesh Garg, Yadati Narahari, Nukala Viswanadham