Sciweavers

741 search results - page 96 / 149
» A Note on the Use of Independent Sets for the k-SAT Problem
Sort
View
UIST
2000
ACM
14 years 1 months ago
A temporal model for multi-level undo and redo
A number of recent systems have provided rich facilities for manipulating the timelines of applications. Such timelines represent the history of an application’s use in some ses...
W. Keith Edwards, Takeo Igarashi, Anthony LaMarca,...
JCP
2008
121views more  JCP 2008»
13 years 8 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
MOBIHOC
2009
ACM
14 years 9 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
14 years 1 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
14 years 20 days ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali