Sciweavers

9842 search results - page 1577 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
KAIS
2011
129views more  KAIS 2011»
15 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
SOFTWARE
2011
15 years 1 months ago
Object-Oriented Parallelisation of Java Desktop Programs
Developing parallel applications is notoriously difficult, but is even more complex for desktop applications. The added difficulties are primarily because of their interactive nat...
Nasser Giacaman, Oliver Sinnen
TMC
2011
261views more  TMC 2011»
15 years 1 months ago
Breath: An Adaptive Protocol for Industrial Control Applications Using Wireless Sensor Networks
—An energy-efficient, reliable and timely data transmission is essential for wireless sensor networks (WSNs) employed in scenarios where plant information must be available for ...
Pan Gun Park, Carlo Fischione, Alvise Bonivento, K...
URBAN
2011
185views more  URBAN 2011»
15 years 1 months ago
Supporting geographically-aware web document foraging and sensemaking
This paper reports on the development and application of strategies and tools for geographic information seeking and knowledge building that leverages unstructured text resources ...
Brian M. Tomaszewski, Justine Blanford, Kevin Ross...
WWW
2011
ACM
15 years 1 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg
« Prev « First page 1577 / 1969 Last » Next »