Sciweavers

868 search results - page 153 / 174
» Finding Most Likely Solutions
Sort
View
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 8 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
VLDB
2007
ACM
164views Database» more  VLDB 2007»
14 years 7 months ago
A new intrusion detection system using support vector machines and hierarchical clustering
Whenever an intrusion occurs, the security and value of a computer system is compromised. Network-based attacks make it difficult for legitimate users to access various network ser...
Latifur Khan, Mamoun Awad, Bhavani M. Thuraisingha...
IRI
2009
IEEE
14 years 2 months ago
Using 4KB Page Size for Virtual Memory is Obsolete
A 4KB page size has been used for Virtual Memory since the sixties. In fact, today, the most common page size is still 4KB. Choosing a page size is finding the middle ground betwe...
Pinchas Weisberg, Yair Wiseman
EUROSSC
2009
Springer
14 years 8 days ago
Wireless Sensor Networks to Enable the Passive House - Deployment Experiences
Finding solutions for the current period of climate change or “global warming” is possibly the most serious and pressing challenge faced by scientists and the wider community t...
Tessa Daniel, Elena I. Gaura, James Brusey
BPM
2010
Springer
128views Business» more  BPM 2010»
13 years 7 months ago
Content-Aware Resolution Sequence Mining for Ticket Routing
Ticket routing is key to the efficiency of IT problem management. Due to the complexity of many reported problems, problem tickets typically need to be routed among various expert ...
Peng Sun, Shu Tao, Xifeng Yan, Nikos Anerousis, Yi...