Sciweavers

1516 search results - page 293 / 304
» How Open is e-Science
Sort
View
CPC
2007
105views more  CPC 2007»
13 years 6 months ago
Packing Cliques in Graphs with Independence Number 2
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
Raphael Yuster
JSAC
2008
161views more  JSAC 2008»
13 years 6 months ago
HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management
Abstract--Radio spectrum resource is of fundamental importance for wireless communication. Recent reports show that most available spectrum has been allocated. While some of the sp...
Juncheng Jia, Qian Zhang, Xuemin Shen
ECCC
2007
122views more  ECCC 2007»
13 years 6 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
KI
2008
Springer
13 years 6 months ago
Wayfinding in Scene Space
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
Urs-Jakob Rüetschi
JMLR
2006
132views more  JMLR 2006»
13 years 6 months ago
Learning to Detect and Classify Malicious Executables in the Wild
We describe the use of machine learning and data mining to detect and classify malicious executables as they appear in the wild. We gathered 1,971 benign and 1,651 malicious execu...
Jeremy Z. Kolter, Marcus A. Maloof