Sciweavers

11129 search results - page 106 / 2226
» Modeling Search Computing Applications
Sort
View
ATAL
2004
Springer
15 years 3 months ago
Time-Variant Distributed Agent Matching Applications
The process of pair partnership formation is an important infrastructure for many plausible MAS applications. Each agent evaluates potential partner agents, where each potential m...
David Sarne, Sarit Kraus
79
Voted
SISAP
2010
IEEE
149views Data Mining» more  SISAP 2010»
14 years 8 months ago
On applications of parameterized hyperplane partitioning
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
Jakub Lokoc, Tomás Skopal
107
Voted
ENTCS
2007
190views more  ENTCS 2007»
14 years 9 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
CVPR
2005
IEEE
16 years 6 days ago
Optimal Sub-Shape Models by Minimum Description Length
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
Georg Langs, Philipp Peloschek, Horst Bischof
ACMSE
2010
ACM
14 years 8 months ago
Mobile web search personalization using ontological user profile
Most present day search engines have a deterministic behavior in the sense that they return the same search results for all users who submit the same query at a certain time. They...
Kapil Goenka, Ismailcem Budak Arpinar, Mustafa Nur...