Sciweavers

2069 search results - page 258 / 414
» Linear time algorithms for Clobber
Sort
View
COCOON
2005
Springer
16 years 22 hour ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
GD
2004
Springer
15 years 12 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
FOCS
2000
IEEE
15 years 11 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
IUI
2000
ACM
15 years 11 months ago
Efficient text summarization using lexical chains
The rapid growth of the Internet has resulted in enormous amounts of information that has become more difficult to access efficiently. Internet users require tools to help manage ...
H. Gregory Silber, Kathleen F. McCoy
NN
2007
Springer
106views Neural Networks» more  NN 2007»
15 years 6 months ago
Machine learning approach to color constancy
A number of machine learning (ML) techniques have recently been proposed to solve color constancy problem in computer vision. Neural networks (NNs) and support vector regression (...
Vivek Agarwal, Andrei V. Gribok, Mongi A. Abidi