Sciweavers

6740 search results - page 251 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
IPL
2007
105views more  IPL 2007»
15 years 20 days ago
Approximability of identifying codes and locating-dominating codes
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
Jukka Suomela
OSDI
2008
ACM
16 years 1 months ago
Mining Console Logs for Large-Scale System Problem Detection
The console logs generated by an application contain messages that the application developers believed would be useful in debugging or monitoring the application. Despite the ubiq...
Wei Xu, Ling Huang, Armando Fox, David A. Patterso...
SIGMETRICS
2005
ACM
163views Hardware» more  SIGMETRICS 2005»
15 years 6 months ago
Smooth switching problem in buffered crossbar switches
Scalability considerations drive the switch fabric design to evolve from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, f...
Simin He, Shutao Sun, Wei Zhao, Yanfeng Zheng, Wen...
103
Voted
CCS
2008
ACM
15 years 2 months ago
Open problems in the security of learning
Machine learning has become a valuable tool for detecting and preventing malicious activity. However, as more applications employ machine learning techniques in adversarial decisi...
Marco Barreno, Peter L. Bartlett, Fuching Jack Chi...
145
Voted

Source Code
441views
16 years 10 months ago
Octave
"GNU Octave is a high-level language, primarily intended for numerical computations. It provides a convenient command line interface for solving linear and nonlinear problems ...