Sciweavers

2354 search results - page 180 / 471
» A Common-Sense Theory of Time
Sort
View
ECIS
2004
15 years 8 months ago
Leveraging Theoretical Pluralism in qualitative IS research: The example of IS professionals' identity as a complex phenomenon
As Information Systems (IS) research increasingly acknowledges the importance of non-positivist approaches, the case for a plurality of theories to guide qualitative studies has g...
Jo-Ann Siregar, Michael T. K. Tan
MOBIHOC
2009
ACM
16 years 7 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 1 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
SIGIR
2006
ACM
16 years 15 days 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
CF
2009
ACM
15 years 11 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu