Sciweavers

13457 search results - page 74 / 2692
» Can we elect if we cannot compare
Sort
View
COMPLEX
2009
Springer
14 years 2 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang
ICML
2004
IEEE
14 years 8 months ago
A comparative study on methods for reducing myopia of hill-climbing search in multirelational learning
Hill-climbing search is the most commonly used search algorithm in ILP systems because it permits the generation of theories in short running times. However, a well known drawback...
Lourdes Peña Castillo, Stefan Wrobel
DSVIS
2003
Springer
14 years 28 days ago
Evaluating and Comparing Interaction Styles
Research has created many new generation (post-WIMP) Interaction styles (IS) in the past years. From Ubiquitous to Affective Computing, researchers have not kept a uniform standard...
Georgios Christou, Robert J. K. Jacob
WONS
2005
IEEE
14 years 1 months ago
Broadcasting in Hybrid Ad Hoc Networks
In this paper, we consider hybrid ad hoc networks, which are composed of two kinds of nodes, regular ones and nodes with additional capabilities. For example, multi-hop cellular a...
François Ingelrest, David Simplot-Ryl, Ivan...
DC
2008
13 years 7 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir