Sciweavers

7596 search results - page 1419 / 1520
» Challenges in forensic computing
Sort
View
WCNC
2008
IEEE
15 years 10 months ago
A Transcoding-Free Multiple Description Coder for Voice over Mobile Ad-Hoc Networks
— We propose a new multiple description (MD) coder design based on the Adaptive Multi-Rate Wideband (AMRWB) coder that can support transcoding-free communication between an ad-ho...
Jagadeesh Balam, Jerry D. Gibson
160
Voted
AIMSA
2008
Springer
15 years 10 months ago
Noun Compound Interpretation Using Paraphrasing Verbs: Feasibility Study
Abstract. The paper addresses an important challenge for the automatic processing of English written text: understanding noun compounds’ semantics. Following Downing (1977) [1], ...
Preslav Nakov
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
15 years 10 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
ANSS
2007
IEEE
15 years 10 months ago
Vehicular Mobility Simulation for VANETs
During the last few years, continuous progresses in wireless communications have opened new research fields in computer networking, aimed at extending data networks connectivity ...
Marco Fiore, Jérôme Härri, Fethi...
CGO
2007
IEEE
15 years 10 months ago
Persistent Code Caching: Exploiting Code Reuse Across Executions and Applications
Run-time compilation systems are challenged with the task of translating a program’s instruction stream while maintaining low overhead. While software managed code caches are ut...
Vijay Janapa Reddi, Dan Connors, Robert Cohn, Mich...
« Prev « First page 1419 / 1520 Last » Next »