Sciweavers

678 search results - page 68 / 136
» Generalized Percolation Processes Using Pretopology Theory
Sort
View
FORTE
2004
13 years 9 months ago
A Minimal Market Model in Ephemeral Markets
Abstract Peer-to-peer markets going mobile spur spontaneity in trading considerably. Spontaneity, however, imposes severe informational requirements on the market participants. Inf...
Daniel Rolli, Dirk Neumann, Christof Weinhardt
SIGIR
2006
ACM
14 years 2 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 27 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
IUSED
2008
13 years 9 months ago
Preparing Usability Supporting Architectural Patterns for Industrial Use
Usability supporting architectural patterns (USAPs) have been shown to provide developers with useful guidance for producing a software architecture design that supports usability...
Pia Stoll, Bonnie E. John, Len Bass, Elspeth Golde...
JCIT
2008
138views more  JCIT 2008»
13 years 8 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan