Sciweavers

257 search results - page 8 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
DCC
2008
IEEE
14 years 8 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
ATAL
2008
Springer
13 years 10 months ago
Demonstration of multi-agent potential fields in real-time strategy games
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...
Johan Hagelbäck, Stefan J. Johansson
IJCAI
2007
13 years 10 months ago
Locating Complex Named Entities in Web Text
Named Entity Recognition (NER) is the task of locating and classifying names in text. In previous work, NER was limited to a small number of predefined entity classes (e.g., peop...
Doug Downey, Matthew Broadhead, Oren Etzioni
TMC
2008
127views more  TMC 2008»
13 years 8 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
PARELEC
2006
IEEE
14 years 2 months ago
Marching Pixels - Using Organic Computing Principles in Embedded Parallel Hardware
We present an organic computing approach for very fast image processing, which we call Marching Pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs...
Marcus Komann, Dietmar Fey