Sciweavers

344 search results - page 68 / 69
» Random Walks on Colored Graphs
Sort
View
DAC
2000
ACM
14 years 8 months ago
Fingerprinting intellectual property using constraint-addition
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
Gang Qu, Miodrag Potkonjak
CIKM
2009
Springer
14 years 2 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
MST
2006
104views more  MST 2006»
13 years 7 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
COR
2000
129views more  COR 2000»
13 years 7 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...
PVLDB
2008
163views more  PVLDB 2008»
13 years 7 months ago
C-DEM: a multi-modal query system for Drosophila Embryo databases
The amount of biological data publicly available has experienced an exponential growth as the technology advances. Online databases are now playing an important role as informatio...
Fan Guo, Lei Li, Christos Faloutsos, Eric P. Xing