Sciweavers

897 search results - page 31 / 180
» Identity: How to name it, How to find it
Sort
View
MFCS
2007
Springer
14 years 2 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
MDM
2010
Springer
152views Communications» more  MDM 2010»
14 years 1 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He
SIGUCCS
2009
ACM
14 years 3 months ago
The many benefits of cultivating a community among IT staff
Conference Abstracts October 11-14, 2009 t provides the abstracts and the author(s)’ name(s) for the technical program. The actual presenter(s) may vary. Updated September 20, 20...
Ken Layng
BIBE
2007
IEEE
141views Bioinformatics» more  BIBE 2007»
14 years 20 days ago
Graph and Topological Structure Mining on Scientific Articles
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
Fan Wang, Ruoming Jin, Gagan Agrawal, Helen Piontk...
DCC
2004
IEEE
14 years 8 months ago
Periodicity and Correlation Properties of d-FCSR Sequences
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
Mark Goresky, Andrew Klapper