Sciweavers

349 search results - page 30 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
WSCG
2003
145views more  WSCG 2003»
13 years 9 months ago
Analysis of Four-Dimensional Cardiac Data Sets Using Skeleton-Based Segmentation
Computer-aided analysis of four-dimensional tomography data has become an important tool in modern cardiology. In order to examine the capability and health of a patient’s cardi...
André Neubauer, Rainer Wegenkittl
RAID
2005
Springer
14 years 1 months ago
Sequence Number-Based MAC Address Spoof Detection
Abstract. The exponential growth in the deployment of IEEE 802.11based wireless LAN (WLAN) in enterprises and homes makes WLAN an attractive target for attackers. Attacks that expl...
Fanglu Guo, Tzi-cker Chiueh
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
14 years 2 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
14 years 8 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
DAC
1999
ACM
14 years 8 months ago
Memory Exploration for Low Power, Embedded Systems
In embedded system design, the designer has to choose an onchip memory configuration that is suitable for a specific application. To aid in this design choice, we present a memory...
Wen-Tsong Shiue, Chaitali Chakrabarti