Sciweavers

3405 search results - page 313 / 681
» Factoring Groups Efficiently
Sort
View
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 11 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
ECIS
2004
15 years 8 months ago
Forecasting ERP implementation success - Towards a grounded framework
The continuing soar in popularity when it comes to standardized information systems sold en masse under the labelling of Enterprise Resource Planning (ERP) Systems is somewhat kep...
Johan Magnusson, Andreas Nilsson, Fredrik Carlsson
BMCBI
2007
164views more  BMCBI 2007»
15 years 6 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
COMSNETS
2012
182views more  COMSNETS 2012»
14 years 2 months ago
Hierarchy-aware distributed overlays in data centers using DC2
—Popular online services such as social networks, e-commerce and bidding are routinely hosted in large-scale data centers. Group communication systems (e.g., multicast) and distr...
Karthik Nagaraj, Hitesh Khandelwal, Charles Edwin ...
CVPR
2007
IEEE
16 years 8 months ago
A Multi-Scale Tikhonov Regularization Scheme for Implicit Surface Modelling
Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape mo...
Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu