Sciweavers

7988 search results - page 1384 / 1598
» A Useful Undecidable Theory
Sort
View
CSCW
2006
ACM
15 years 10 months ago
Improving network efficiency in real-time groupware with general message compression
Groupware communicates by sending messages across the network, and groupware programmers use a variety of formats for these messages, such as XML, plain text, or serialized object...
Carl Gutwin, Christopher Fedak, Mark Watson, Jeff ...
DOCENG
2006
ACM
15 years 10 months ago
NEWPAR: an automatic feature selection and weighting schema for category ranking
Category ranking provides a way to classify plain text documents into a pre-determined set of categories. This work proposes to have a look at typical document collections and ana...
Fernando Ruiz-Rico, José Luis Vicedo Gonz&a...
MOBICOM
2006
ACM
15 years 10 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
SIGCOMM
2006
ACM
15 years 10 months ago
Growth codes: maximizing sensor network data persistence
Sensor networks are especially useful in catastrophic or emergency scenarios such as floods, fires, terrorist attacks or earthquakes where human participation may be too dangero...
Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rube...
BROADNETS
2005
IEEE
15 years 10 months ago
Dual-link failure resiliency through backup link mutual exclusion
— Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternative...
Amit Chandak, Srinivasan Ramasubramanian
« Prev « First page 1384 / 1598 Last » Next »