Sciweavers

159 search results - page 16 / 32
» Open Problems from CCCG 2008
Sort
View
IPL
2007
94views more  IPL 2007»
13 years 6 months ago
A note on the Hadwiger number of circular arc graphs
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...
COMCOM
2004
79views more  COMCOM 2004»
13 years 7 months ago
Anomaly detection methods in wired networks: a survey and taxonomy
Despite the advances reached along the last 20 years, anomaly detection in network behavior is still an immature technology, and the shortage of commercial tools thus corroborates...
Juan M. Estévez-Tapiador, Pedro Garcia-Teod...
SAC
2008
ACM
13 years 6 months ago
Configuring features with stakeholder goals
Goal models are effective in capturing stakeholder needs at the time when features of the system-to-be have not yet been conceptualized. Relating goals to solution-oriented featur...
Yijun Yu, Julio Cesar Sampaio do Prado Leite, Alex...
ECCC
2008
168views more  ECCC 2008»
13 years 7 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson
FTDB
2008
82views more  FTDB 2008»
13 years 7 months ago
Information Extraction
The automatic extraction of information from unstructured sources has opened up new avenues for querying, organizing, and analyzing data by drawing upon the clean semantics of str...
Sunita Sarawagi